How to rig elections and competitions

N Hazon; P. E Dunne; S Kraus; M Wooldridge

How to rig elections and competitions

N Hazon, P. E Dunne, S Kraus, M Wooldridge

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We investigate the extent to which it is possible to rig the agenda of an election or competition so as to favor a particular candidate in the presence of imperfect information about the preferences of the electorate. We assume that what is known about an electorate is the probability that any given candidate will beat another. As well as presenting some analytical results relating to the complexity of finding and verifying agenda, we develop heuristics for agenda rigging, and investigate the performance of these heuristics for both randomly generated data and real-world data from tennis and basketball competitions.

Original language	American English
Title of host publication	COMSOC
State	Published - 2008

Bibliographical note

Place of conference:England

Cite this

@inproceedings{0c38e83089e94d3687c1e95cc8e0ffab,

title = "How to rig elections and competitions",

abstract = "We investigate the extent to which it is possible to rig the agenda of an election or competition so as to favor a particular candidate in the presence of imperfect information about the preferences of the electorate. We assume that what is known about an electorate is the probability that any given candidate will beat another. As well as presenting some analytical results relating to the complexity of finding and verifying agenda, we develop heuristics for agenda rigging, and investigate the performance of these heuristics for both randomly generated data and real-world data from tennis and basketball competitions.",

author = "N Hazon and Dunne, {P. E} and S Kraus and M Wooldridge",

note = "Place of conference:England",

year = "2008",

language = "American English",

booktitle = "COMSOC",

}

TY - GEN

T1 - How to rig elections and competitions

AU - Hazon, N

AU - Dunne, P. E

AU - Kraus, S

AU - Wooldridge, M

N1 - Place of conference:England

PY - 2008

Y1 - 2008

N2 - We investigate the extent to which it is possible to rig the agenda of an election or competition so as to favor a particular candidate in the presence of imperfect information about the preferences of the electorate. We assume that what is known about an electorate is the probability that any given candidate will beat another. As well as presenting some analytical results relating to the complexity of finding and verifying agenda, we develop heuristics for agenda rigging, and investigate the performance of these heuristics for both randomly generated data and real-world data from tennis and basketball competitions.

AB - We investigate the extent to which it is possible to rig the agenda of an election or competition so as to favor a particular candidate in the presence of imperfect information about the preferences of the electorate. We assume that what is known about an electorate is the probability that any given candidate will beat another. As well as presenting some analytical results relating to the complexity of finding and verifying agenda, we develop heuristics for agenda rigging, and investigate the performance of these heuristics for both randomly generated data and real-world data from tennis and basketball competitions.

UR - https://scholar.google.co.il/scholar?q=%09How+to+Rig+Elections+and+Competitions&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - COMSOC

ER -

How to rig elections and competitions

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this