loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Author: Andrew Lin

Affiliation: Rochester Intitute of Technology, United States

Keyword(s): Elections manipulation approval complexity.

Related Ontology Subjects/Areas/Topics: Agents ; Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Distributed and Mobile Software Systems ; Enterprise Information Systems ; Group Decision Making ; Knowledge Engineering and Ontology Development ; Knowledge-Based Systems ; Multi-Agent Systems ; Negotiation and Interaction Protocols ; Software Engineering ; Symbolic Systems

Abstract: An important problem in computational social choice theory is the complexity of undesirable behavior among agents, such as control, manipulation, and bribery in election systems, which are tempting at the individual level but disastrous for the agents as a whole. Creating election systems where the determination of such strategies is difficult is thus an important goal. An interesting set of elections is that of scoring protocols. Previous work in this area has demonstrated the complexity of misuse in cases involving a fixed number of candidates, and of specific election systems on unbounded number of candidates such as Borda. In contrast, we take the first step in generalizing the results of computational complexity of election misuse to cases of infinitely many scoring protocols on an unbounded number of candidates. We demonstrate the worst-case complexity of various problems in this area, by showing they are either polynomial-time computable, NP-hard, or polynomial-time equivalent to another problem of interest. We also demonstrate a surprising connection between manipulation in election systems and some graph theory problems. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.133.140.88

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Lin, A. (2011). THE COMPLEXITY OF MANIPULATING κ-APPROVAL ELECTIONS. In Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART; ISBN 978-989-8425-41-6; ISSN 2184-433X, SciTePress, pages 212-218. DOI: 10.5220/0003168802120218

@conference{icaart11,
author={Andrew Lin.},
title={THE COMPLEXITY OF MANIPULATING κ-APPROVAL ELECTIONS},
booktitle={Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART},
year={2011},
pages={212-218},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003168802120218},
isbn={978-989-8425-41-6},
issn={2184-433X},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART
TI - THE COMPLEXITY OF MANIPULATING κ-APPROVAL ELECTIONS
SN - 978-989-8425-41-6
IS - 2184-433X
AU - Lin, A.
PY - 2011
SP - 212
EP - 218
DO - 10.5220/0003168802120218
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic