Journal article icon

Journal article

Computational aspects of nearly single-peaked electorates

Abstract:

Manipulation, bribery, and control are well-studied ways of changing the outcome of an election. Many voting rules are, in the general case, computationally resistant to some of these manipulative actions. However when restricted to single-peaked electorates, these rules suddenly become easy to manipulate. Recently, Faliszewski, Hemaspaandra, and Hemaspaandra studied the computational complexity of strategic behavior in nearly singlepeaked electorates. These are electorates that are not si...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1613/jair.5210

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
Association for the Advancement of Artificial Intelligence Publisher's website
Journal:
Journal of Artificial Intelligence Research Journal website
Volume:
58
Issue:
2017
Pages:
297-337
Publication date:
2017-02-01
Acceptance date:
2017-01-02
DOI:
EISSN:
1943-5037
ISSN:
1076-9757
Source identifiers:
680022
Pubs id:
pubs:680022
UUID:
uuid:65025da2-eb1a-4834-9bb7-0d1c0762a6d7
Local pid:
pubs:680022
Deposit date:
2017-02-14

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP