Algorithmic Aspects of Private Bayesian Persuasion.
From MaRDI portal
Publication:4638086
DOI10.4230/LIPICS.ITCS.2017.34zbMath1402.68081arXiv1603.01444OpenAlexW2774852674MaRDI QIDQ4638086
Siddharth Barman, Yakov Babichenko
Publication date: 3 May 2018
Full work available at URL: https://arxiv.org/abs/1603.01444
Analysis of algorithms and problem complexity (68Q25) Economics of information (91B44) Signaling and communication in game theory (91A28) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
The secretary recommendation problem ⋮ Public Bayesian persuasion: being almost optimal and almost persuasive ⋮ Increasing revenue in Bayesian posted price auctions through signaling ⋮ Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models ⋮ A population's feasible posterior beliefs ⋮ Modes of persuasion toward unanimous consent ⋮ On the hardness of designing public signals ⋮ Persuasion and incentives through the lens of duality ⋮ Algorithms for Persuasion with Limited Communication
Cites Work
- Unnamed Item
- Unnamed Item
- Expert advice to a voting body
- Inapproximability results for combinatorial auctions with submodular utility functions
- Stress tests and information disclosure
- On the value of persuasion by experts
- Bayesian persuasion with multiple senders and rich signal spaces
- Private Bayesian persuasion
- Finite supermodular design with interdependent valuations
- Information structures in optimal auctions
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Strategic Information Transmission
- Discrete Convex Analysis
- Convexity and Steinitz's exchange property
- Approximating theDomatic Number
- Algorithmic Bayesian Persuasion
- Constrained Signaling in Auction Design
This page was built for publication: Algorithmic Aspects of Private Bayesian Persuasion.
