mlsanityData to 14 Oct 2026

Complexity Results of Persuasion

arXiv 2507.05951 ↗First posted 8 Jul 2025cs.CC cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We prove that persuasion is an NP-complete problem.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 2 references that are in the map. First posted on arXiv 8 Jul 2025.

Builds on

1 of 2 references.

References · 1

  1. 2024When and Why is Persuasion Hard? A Computational Complexity Resultcited by 4

Built on by

Not cited yet.