Algorithmic persuasion with evidence

DOI10.4230/LIPICS.ITCS.2021.3MaRDI QIDQ7229286zbMATH OpenFDO

Authors Martin Hoefer, Pasin Manurangsi, Alexandros Psomas

Publication date 15 April 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2021.3

zbMATH Keywords

approximation algorithmsBayesian persuasionsemidefinite programming

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• .878-approximation algorithms for MAX CUT and MAX 2SAT
• Algorithmic Bayesian persuasion
• Balanced max 2-sat might not be the hardest
• Credibility and determinism in a game of persuasion
• Hard evidence and mechanism design
• Hardness of bipartite expansion
• How to Round Any CSP
• scientific article; zbMATH DE number 5485536 (Why is no real title available?)
• scientific article; zbMATH DE number 2086914 (Why is no real title available?)
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On Optimal Rules of Persuasion
• On the hardness of designing public signals
• Persuasion and dynamic communication
• Persuasion and incentives through the lens of duality
• Strategic communication with minimal verification
• Towards sharp inapproximability for any 2-CSP

This page was built for publication: Algorithmic persuasion with evidence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229286)