TL;DR
This paper establishes that determining the outcome of persuasion strategies is computationally hard, specifically NP-complete, highlighting fundamental complexity limitations in persuasion problems.
Contribution
The paper proves that persuasion problems are NP-complete, providing a key complexity classification for this area.
Findings
Persuasion is NP-complete.
Complexity results impact the design of persuasion algorithms.
Highlights computational challenges in persuasion strategies.
Abstract
We prove that persuasion is an NP-complete problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Game Theory and Applications · Logic, Reasoning, and Knowledge