paper

Complexity Results of Persuasion

arXiv:2507.05951

Abstract

We prove that persuasion is an NP-complete problem.