skip to main content
10.1145/3371158.3371213acmotherconferencesArticle/Chapter ViewAbstractPublication PagescodsConference Proceedingsconference-collections
short-paper

Protecting Elections

Published: 15 January 2020 Publication History

Abstract

Election control considers the issues where an external agent wants to change the structure of the election to change the outcome. Researchers model the problem as a Stackelberg game with two players, Defender and Attacker. The questions we focus on are, is it possible for the attacker to influence the outcome of the election? How hard is it to change the winner by deleting or manipulating a finite number of voter groups? How hard is it to defend the election with a finite budget? How the problem of attack and defend varies with the limited information the defender and attacker have?

References

[1]
John J Bartholdi III, Craig A Tovey, and Michael A Trick. 1992. How hard is it to control an election? Mathematical and Computer Modelling 16, 8-9 (1992), 27--40.
[2]
Palash Dey, Neeldhara Misra, Swaprava Nath, and Garima Shakya. 2019. A Parameterized Perspective on Protecting Elections. In IJCAI. 238--244.
[3]
Yue Yin, Yevgeniy Vorobeychik, Bo An, and Noam Hazon. 2016. Optimally Protecting Elections. In IJCAI. 538--545.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
CoDS COMAD 2020: Proceedings of the 7th ACM IKDD CoDS and 25th COMAD
January 2020
399 pages
ISBN:9781450377386
DOI:10.1145/3371158
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 January 2020

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Short-paper
  • Research
  • Refereed limited

Conference

CoDS COMAD 2020
CoDS COMAD 2020: 7th ACM IKDD CoDS and 25th COMAD
January 5 - 7, 2020
Hyderabad, India

Acceptance Rates

CoDS COMAD 2020 Paper Acceptance Rate 78 of 275 submissions, 28%;
Overall Acceptance Rate 197 of 680 submissions, 29%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 118
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media