Bayesian Exploration: Incentivizing Exploration in Bayesian Games

DOI10.1287/opre.2021.2205zbMath1493.91078arXiv1602.07570OpenAlexW2952275065MaRDI QIDQ5080666

Vasilis Syrgkanis, Yishay Mansour, Alex Slivkins, Zhiwei Steven Wu

Publication date: 31 May 2022

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.07570

zbMATH Keywords

Bayesian persuasionBayesian incentive compatibilityinformation designmultiarmed banditsexploration-exploitation trade-offrevenue management and market analyticsBayes-correlated equilibriumBayesian regret

Mathematics Subject Classification ID

Economics of information (91B44) Principal-agent models (91B43) Games with incomplete information, Bayesian games (91A27)

Related Items (4)

Multi-round cooperative search games with multiple players ⋮ Public Bayesian persuasion: being almost optimal and almost persuasive ⋮ Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models ⋮ Regret-minimizing Bayesian persuasion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotically efficient adaptive allocation rules
• Truthful Mechanisms with Implicit Payment Computation
• Robust Predictions in Games With Incomplete Information
• Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems
• Learning and incentives in user-generated content
• Multi‐Armed Bandit Allocation Indices
• Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
• Bayesian Incentive-Compatible Bandit Exploration
• Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
• The Dynamic Pivot Mechanism
• Experimentation in Markets
• Strategic Experimentation
• Recommender Systems as Mechanisms for Social Learning*
• The Nonstochastic Multiarmed Bandit Problem
• Algorithmic Bayesian Persuasion
• Bandit Algorithms
• Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism
• Introduction to Multi-Armed Bandits
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• An Efficient Dynamic Mechanism
• Characterizing Truthful Multi-armed Bandit Mechanisms
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Bayesian Exploration: Incentivizing Exploration in Bayesian Games