# Complexity Results of Persuasion

arXiv: https://arxiv.org/abs/2507.05951 · HTML: https://mlsanity.com/paper/2507.05951/

## 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 (most cited first, 1 of 1)

- [When and Why is Persuasion Hard? A Computational Complexity Result](https://mlsanity.com/paper/2408.07923/) (2024)

## Abstract (arXiv)

We prove that persuasion is an NP-complete problem.