Anyone but Him: The Complexity of Precluding an Alternative
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2005
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910040491819008 |
|---|---|
| author | Hemaspaandra, Edith Hemaspaandra, Lane A. Rothe, Joerg |
| author_facet | Hemaspaandra, Edith Hemaspaandra, Lane A. Rothe, Joerg |
| contents | Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preference aggregation to destructive control. That is, we study the ability of an election's chair to, through such mechanisms as voter/candidate addition/suppression/partition, ensure that a particular candidate (equivalently, alternative) does not win. And we study the extent to which election systems can make it impossible, or computationally costly (NP-complete), for the chair to execute such control. Among the systems we study--plurality, Condorcet, and approval voting--we find cases where systems immune or computationally resistant to a chair choosing the winner nonetheless are vulnerable to the chair blocking a victory. Beyond that, we see that among our studied systems no one system offers the best protection against destructive control. Rather, the choice of a preference aggregation system will depend closely on which types of control one wishes to be protected against. We also find concrete cases where the complexity of or susceptibility to control varies dramatically based on the choice among natural tie-handling rules. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_cs_0507027 |
| institution | arXiv |
| publishDate | 2005 |
| record_format | arxiv |
| spellingShingle | Anyone but Him: The Complexity of Precluding an Alternative Hemaspaandra, Edith Hemaspaandra, Lane A. Rothe, Joerg Computer Science and Game Theory Computational Complexity Multiagent Systems I.2.11; F.2.2; F.1.3 Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preference aggregation to destructive control. That is, we study the ability of an election's chair to, through such mechanisms as voter/candidate addition/suppression/partition, ensure that a particular candidate (equivalently, alternative) does not win. And we study the extent to which election systems can make it impossible, or computationally costly (NP-complete), for the chair to execute such control. Among the systems we study--plurality, Condorcet, and approval voting--we find cases where systems immune or computationally resistant to a chair choosing the winner nonetheless are vulnerable to the chair blocking a victory. Beyond that, we see that among our studied systems no one system offers the best protection against destructive control. Rather, the choice of a preference aggregation system will depend closely on which types of control one wishes to be protected against. We also find concrete cases where the complexity of or susceptibility to control varies dramatically based on the choice among natural tie-handling rules. |
| title | Anyone but Him: The Complexity of Precluding an Alternative |
| topic | Computer Science and Game Theory Computational Complexity Multiagent Systems I.2.11; F.2.2; F.1.3 |
| url | https://arxiv.org/abs/cs/0507027 |