Algorithmic Bayesian persuasion

DOI10.1145/2897518.2897583MaRDI QIDQ6829696zbMATH OpenFDO

Authors Shaddin Dughmi, Haifeng Xu

Publication date 29 September 2017

Published in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2897518.2897583

zbMATH Keywords

Bayesian persuasioninformation structuressignaling

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Signaling and communication in game theory (91A28) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cited in

(3)

• Information agreements
• Algorithmic persuasion with evidence
• How to sell information optimally: an algorithmic study

This page was built for publication: Algorithmic Bayesian persuasion

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