Efficient algorithms exist for optimal private Bayesian persuasion of voters under k-voting and plurality rules, but optimal public persuasion is NP-hard to approximate by any factor.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Persuading Voters: It's Easy to Whisper, It's Hard to Speak Loud
Efficient algorithms exist for optimal private Bayesian persuasion of voters under k-voting and plurality rules, but optimal public persuasion is NP-hard to approximate by any factor.