Bribery in elections with randomly selected voters: Hardness and algorithm

Many research works in computational social choice assume a fixed set of voters in an election and study the resistance of different voting rules against electoral manipulation. In recent years, however, a new technique known as random sample voting has been adopted in many multi-agent systems. One...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1036; p. 115150
Main Authors:	Tao, Liangde, Chen, Lin, Xu, Lei, Shi, Weidong, Mahabub Uz Zaman, Md, Sunny, Ahmed
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 03.05.2025
Subjects:	Approximation algorithms Computational social choice Polynomial-time approximation scheme Approximation algorithms Polynomial-time approximation scheme Computational social choice
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!