Dynamic Mechanism Design: Incentive Compatibility, Profit Maximization and Information Disclosure
We examine the design of incentive-compatible screening mechanisms for dynamic environments in which the agents types follow a (possibly non-Markov) stochastic process, decisions may be made over time and may affect the type process, and payoffs need not be time-separable. We derive a formula for the derivative of an agent’s equilibrium payoff with respect to his current type in an incentive-compatible mechanism, which summarizes all first-order conditions for incentive compatibility and generalizes Mirrlees’s envelope formula of static mechanism design. We provide conditions on the environment under which this formula must hold in any incentive-compatible mechanism. When specialized to quasi-linear environments, this formula yields a dynamic revenue-equivalence result and an expression for dynamic virtual surplus, which is instrumental for the design of optimal mechanisms. We also provide some sufficient conditions for incentive compatibility, and for its robustness to an agent’s observation of the other agents’ past and future types. We apply these results to a number of novel settings, including the design of profit-maximizing auctions and durable-good selling mechanisms for buyers whose values follow an AR(k) process.
|Date of creation:||08 May 2009|
|Date of revision:|
|Contact details of provider:|| Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014|
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:nwu:cmsems:1501. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker)
If references are entirely missing, you can add them using this form.