Real candidacy games: A new model for strategic candidacy

Itay Sabato, Svetlana Obraztsova, Zinovi Rabinovich, Jeffrey S. Rosenschein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We introduce Real Candidacy Games (RCGs)-A novel strategic candidacy model, where candidates have a continuous range of positions that affect their attractiveness for voters. We also allow candidates to have their own non-Trivial preferences over the candidate set. We study RCGs with restricted and unrestricted positioning strategies to establish conditions for Nash Equilibrium (NE) existence. That is, we investigate under what voting rules and tie- breaking schemes, a stable candidate positioning exists. While for several voting rule classes (e.g., Condorcet-Consistent) we obtain positive results, we also show that for some scoring rules there are examples without a NE for an arbitrarily large number of voters.

Original languageEnglish
Title of host publication16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017
EditorsSanmay Das, Edmund Durfee, Kate Larson, Michael Winikoff
Pages867-875
Number of pages9
ISBN (Electronic)9781510855076
StatePublished - 2017
Event16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 - Sao Paulo, Brazil
Duration: 8 May 201712 May 2017

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume2

Conference

Conference16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017
Country/TerritoryBrazil
CitySao Paulo
Period8/05/1712/05/17

Keywords

  • Candidacy games
  • Hotelling-downs model
  • Social choice

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering

Cite this