Abstract
In “The Logic of Campaigning”, Dean and Parikh consider a candidate making campaign statements to appeal to the voters. They model these statements as Boolean formulas over variables that represent stances on the issues, and study optimal candidate strategies under three proposed models of voter preferences based on the assignments that satisfy these formulas. We prove that voter utility evaluation is computationally hard under these preference models (in one case, P -hard), along with certain problems related to candidate strategic reasoning. Our results raise questions about the desirable characteristics of a voter preference model and to what extent a polynomial-time-evaluable function can capture them.
Original language | English |
---|---|
Title of host publication | Algorithmic Decision Theory - 5th International Conference, ADT 2017, Proceedings |
Editors | Jorg Rothe |
Pages | 153-165 |
Number of pages | 13 |
DOIs | |
State | Published - 2017 |
Event | 5th International Conference on Algorithmic Decision Theory, ADT 2017 - Luxembourg, Luxembourg Duration: Oct 25 2017 → Oct 27 2017 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10576 LNAI |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 5th International Conference on Algorithmic Decision Theory, ADT 2017 |
---|---|
Country/Territory | Luxembourg |
City | Luxembourg |
Period | 10/25/17 → 10/27/17 |
Bibliographical note
Publisher Copyright:© 2017, Springer International Publishing AG.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science