The complexity of campaigning

DOI10.1007/978-3-319-67504-6_11MaRDI QIDQ1990296zbMATH OpenOpenAlexFDO

Authors Cory Siler, Luke Harold Miles, J. Goldsmith

Publication date 25 October 2018

Full work available at URL https://arxiv.org/abs/1706.06243

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

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.

Recommendations

• The logic of campaigning
• The strategy of campaigning
• Focusing on Campaigns
• Campaigning internally or externally
• The complexity of Kemeny elections
• A model of an election campaign
• Campaign rhetoric and the hide-and-seek game
• Extremism, campaigning and ambiguity
• Campaign management under approval-driven voting rules
• Dynamic analysis of an electoral campaign

Cited in

(4)

• The strategy of campaigning
• Focusing on Campaigns
• The logic of campaigning
• Positive and negative campaigning in primary and general elections

This page was built for publication: The complexity of campaigning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990296)