Optimal Stopping with Private Information
34 Pages Posted: 10 Jul 2013 Last revised: 8 May 2014
Date Written: May 6, 2014
Abstract
Many economic situations are modeled as stopping problems. Examples include job search, timing of market entry decisions, irreversible investment or the pricing of American options. This paper analyzes optimal stopping as a mechanism design problem with transfers. We show that a under a dynamic single crossing condition a stopping rule can be implemented by a transfer that only depends on the realized stopping decision if and only if it is a cut-off rule. We characterize the transfer implementing a given stopping rule using a novel technique based on constrained stochastic processes.
As an application we prove that in any Markovian optimal stopping problem there exists a welfare maximizing mechanism that does not require any communication. We discuss revenue maximization for separable processes.
Keywords: Dynamic Mechanism Design, Optimal Stopping, Dynamic Implementability, Posted-Price Mechanism
JEL Classification: D82, C62
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
By Dirk Bergemann and Juuso Valimaki
-
Auctions with Dynamic Populations: Efficiency and Revenue Maximization
By Maher Said
-
By Dirk Bergemann and Juuso Valimaki
-
By Dirk Bergemann and Juuso Valimaki
-
Efficient Dynamic Allocation with Uncertain Valuations
By Abhishek Bapna and Thomas A. Weber
-
Dynamic Marginal Contribution Mechanism
By Dirk Bergemann and Juuso Valimaki
-
By Dirk Bergemann and Maher Said
-
By Dirk Bergemann and Maher Said
-
Optimal Contracting of New Experience Goods
By Rahul Deb