Anton Kolotilin

dblp:142/4986 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
0000-0003-2632-0187ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 On Monotone Persuasion
abstract
We study monotone persuasion in the linear case, where posterior distributions over states are summarized by their mean. We develop a novel methodological approach to solve the two leading cases where optimal unrestricted signals can be nonmonotone. First, if the objective is s-shaped and the state is discrete, then optimal monotone signals are upper censorship, whereas optimal unrestricted signals may require randomization. Second, if the objective is m-shaped and the state is continuous, then optimal monotone signals are interval disclosure, whereas optimal unrestricted signals may require nonmonotone pooling. Unlike with unrestricted persuasion, the value of monotone persuasion can decrease with the informativeness of the prior. We illustrate our results with an application to media censorship.
Anton Kolotilin, Andriy Zapechelnyuk
EC1