scholarly journals Non‐Clairvoyant Dynamic Mechanism Design

Econometrica ◽  
2020 ◽  
Vol 88 (5) ◽  
pp. 1939-1963 ◽  
Author(s):  
Vahab Mirrokni ◽  
Renato Paes Leme ◽  
Pingzhong Tang ◽  
Song Zuo

We introduce a new family of dynamic mechanisms that restricts sellers from using future distributional knowledge. Since the allocation and pricing of each auction period do not depend on the type distributions of future periods, we call this family of dynamic mechanisms non‐clairvoyant. We develop a framework (bank account mechanisms) for characterizing, designing, and proving lower bounds for dynamic mechanisms (clairvoyant or non‐clairvoyant). We use the same methods to compare the revenue extraction power of clairvoyant and non‐clairvoyant dynamic mechanisms.


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)



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


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




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


2018 ◽  
Vol 108 (10) ◽  
pp. 3057-3103 ◽  
Author(s):  
Rahul Deb ◽  
Mallesh M. Pai ◽  
Maher Said

Motivated by the question of how one should evaluate professional election forecasters, we study a novel dynamic mechanism design problem without transfers. A principal who wishes to hire only high-quality forecasters is faced with an agent of unknown quality. The agent privately observes signals about a publicly observable future event, and may strategically misrepresent information to inflate the principal’s perception of his quality. We show that the optimal deterministic mechanism is simple and easy to implement in practice: it evaluates a single, optimally timed prediction. We study the generality of this result and its robustness to randomization and noncommitment. (JEL C53, D72, D82)



Sign in / Sign up

Export Citation Format

Share Document