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.
|Title of host publication||Algorithmic Decision Theory - 5th International Conference, ADT 2017, Proceedings|
|Number of pages||13|
|State||Published - 2017|
|Event||5th International Conference on Algorithmic Decision Theory, ADT 2017 - Luxembourg, Luxembourg|
Duration: Oct 25 2017 → Oct 27 2017
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||5th International Conference on Algorithmic Decision Theory, ADT 2017|
|Period||10/25/17 → 10/27/17|
Bibliographical noteFunding Information:
Acknowledgments. The authors thank three anonymous reviewers for their helpful feedback and thank Alec Gilbert for catching errors in a late draft. All remaining errors are the responsibility of the authors. This material is based upon work partially supported by the National Science Foundation under Grants No. IIS-1646887 and No. IIS-1649152. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.
© 2017, Springer International Publishing AG.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)