Algorithmic Bayesian Persuasion
Publication:4997315
DOI10.1137/16M1098334zbMath1464.91022arXiv1503.05988OpenAlexW1594152038WikidataQ126979527 ScholiaQ126979527MaRDI QIDQ4997315
Publication date: 29 June 2021
Published in: SIAM Journal on Computing, Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.05988
Bayesian problems; characterization of Bayes procedures (62C10) 2-person games (91A05) Auctions, bargaining, bidding and selling, and other market models (91B26) Economics of information (91B44) Signaling and communication in game theory (91A28) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Algorithmic game theory and complexity (91A68)
Related Items (16)
Cites Work
- Unnamed Item
- Unnamed Item
- Reduced form auctions revisited
- Geometric algorithms and combinatorial optimization
- Stress tests and information disclosure
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Bayesian persuasion with multiple senders and rich signal spaces
- Experimental design to persuade
- Information structures in optimal auctions
- Price of Correlations in Stochastic Optimization
- Bayesian Incentive-Compatible Bandit Exploration
- Strategic Information Transmission
- Optimal Auction Design
- Implementation of Reduced Form Auctions: A Geometric Approach
- Bayes correlated equilibrium and the comparison of information structures in games
- Persuasion of a Privately Informed Receiver
- Efficient Computation of Optimal Auctions via Reduced Forms
- Constrained Signaling in Auction Design
- An algorithmic characterization of multi-dimensional mechanisms
- Optimal Information Disclosure in Auctions and the Handicap Auction
This page was built for publication: Algorithmic Bayesian Persuasion