Complexity Results of Persuasion
arXiv:2507.05951v1
Originality Incremental advance
AI Analysis
This result is foundational for computational social choice and game theory, showing that persuasion is computationally hard, which is incremental as it builds on known complexity theory.
The paper tackled the computational complexity of persuasion, proving that persuasion is an NP-complete problem.
We prove that persuasion is an NP-complete problem.