Dynamic Mechanism Design with Budget Constrained Buyers Under Limited Commitment

Author(s):  
Santiago Balseiro ◽  
Omar Besbes ◽  
Gabriel Y. Weintraub

2019 ◽  
Vol 67 (3) ◽  
pp. 711-730 ◽  
Author(s):  
Santiago R. Balseiro ◽  
Omar Besbes ◽  
Gabriel Y. Weintraub


2019 ◽  
Author(s):  
Bin Liu ◽  
Dongri Liu ◽  
Jingfeng Lu


2006 ◽  
Vol 126 (1) ◽  
pp. 235-285 ◽  
Author(s):  
Matthias Doepke ◽  
Robert M. Townsend


2019 ◽  
Vol 57 (2) ◽  
pp. 235-274 ◽  
Author(s):  
Dirk Bergemann ◽  
Juuso Välimäki

We provide an introduction to the recent developments of dynamic mechanism design, with a primary focus on the quasilinear case. First, we describe socially optimal (or efficient) dynamic mechanisms. These mechanisms extend the well-known Vickrey– Clark–Groves and D’Aspremont–Gérard–Varet mechanisms to a dynamic environment. Second, we discuss revenue optimal mechanisms. We cover models of sequential screening and revenue-maximizing auctions with dynamically changing bidder types. We also discuss models of information management where the mechanism designer can control (at least partially) the stochastic process governing the agents’ types. Third, we consider models with changing populations of agents over time. After discussing related models with risk-averse agents and limited liability, we conclude with a number of open questions and challenges that remain for the theory of dynamic mechanism design. ( JEL D44, D81, D82)



2015 ◽  
Vol 19 (3) ◽  
pp. 211-228 ◽  
Author(s):  
Swaprava Nath ◽  
Onno Zoeter ◽  
Y. Narahari ◽  
Christopher R. Dance


2013 ◽  
Author(s):  
Rodrigo Harrison ◽  
Roger Lagunoff


Sign in / Sign up

Export Citation Format

Share Document