References (14)


Citations (1)



Optimal Stopping with Private Information

Thomas Kruse

Université d'Évry - Departement de Mathematiques

Philipp Strack

UC Berkeley, Department of Economics

May 6, 2014

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.

Number of Pages in PDF File: 34

Keywords: Dynamic Mechanism Design, Optimal Stopping, Dynamic Implementability, Posted-Price Mechanism

JEL Classification: D82, C62

Open PDF in Browser Download This Paper

Date posted: July 10, 2013 ; Last revised: May 8, 2014

Suggested Citation

Kruse, Thomas and Strack, Philipp, Optimal Stopping with Private Information (May 6, 2014). Available at SSRN: http://ssrn.com/abstract=2291937 or http://dx.doi.org/10.2139/ssrn.2291937

Contact Information

Thomas Kruse
Université d'Évry - Departement de Mathematiques ( email )
Rue du Pere Jarlan
Evry, 91025
Philipp Strack (Contact Author)
UC Berkeley, Department of Economics ( email )
310 Barrows Hall
Berkeley, CA 94720
United States
HOME PAGE: http://philippstrack.com
Feedback to SSRN

Paper statistics
Abstract Views: 1,709
Downloads: 536
Download Rank: 37,239
References:  14
Citations:  1

© 2016 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollobot1 in 2.609 seconds