The platform design problem

DOI10.1007/978-3-030-94676-0_18OpenAlexW4206768062MaRDI QIDQ2152125

Kiran Vodrahalli, Mihalis Yannakakis, Christos H. Papadimitriou

Publication date: 6 July 2022

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

zbMATH Keywords

Markov decision processapproximation algorithmsStackelberg gamesbi-level optimizationtheory of the online firm

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)

Related Items (1)

Resilient Information Aggregation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fairness through awareness
• On the Stability of the Competitive Equilibrium, II
• Bayesian Incentive-Compatible Bandit Exploration
• Mechanism Design by an Informed Principal
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Delay-Predictability Trade-offs in Reaching a Secret Goal
• The limitations of optimization from samples
• Private Sequential Learning
• Prediction, Learning, and Games

This page was built for publication: The platform design problem