Dynamic Mechanism Design: Incentive Compatibility, Prot Maximization and Information Disclosure
نویسندگان
چکیده
We examine the design of incentive-compatible screening mechanisms for dynamic environments in which the agentstypes follow a (possibly non-Markov) stochastic process, decisions may be made over time and may a¤ect the type process, and payo¤s need not be time-separable. We derive a formula for the derivative of an agents equilibrium payo¤ with respect to his current type in an incentive-compatible mechanism, which summarizes all rst-order conditions for incentive compatibility and generalizes Mirrleess envelope formula of static mechanism design. We provide conditions on the environment under which this formula must hold in any incentivecompatible 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 su¢ cient conditions for incentive compatibility, and for its robustness to an agents observation of the other agents past and future types. We apply these results to a number of novel settings, including the design of pro t-maximizing auctions and durable-good selling mechanisms for buyers whose values follow an AR(k) process. JEL Classi cation Numbers: D82, C73, L1. Keywords: asymmetric information, stochastic processes, incentives For useful suggestions, we thank seminar participants at various institutions where this paper was presented. A special thank is to Li Hao and Narayana Kocherlakota for very detailed comments. Pavan also thanks the hospitality of Collegio Carlo Alberto where part of this work was completed. This paper supersedes previous working papers Revenue Equivalence, Pro t Maximization and Transparency in Dynamic Mechanisms by Segal and Toikka and Long-Term Contracting in a Changing Worldby Pavan. Earlier versions contained a section on the independentshock approach which has now been incorporated in a companion paper (still work in progress). While waiting for a draft, the reader interested in this part can look at Section 3.3 in the November 2008 version posted on our webpages.
منابع مشابه
Dynamic Mechanism Design: Revenue Equivalence, Prot Maximization and Information Disclosure Preliminary and incomplete
This paper examines the problem of how to design incentive-compatible mechanisms in environments in which the agentsprivate information evolves stochastically over time and in which decisions have to be made in each period. The environments we consider are fairly general in that the agentstypes are allowed to evolve in a non-Markov way, decisions are allowed to a¤ect the type distributions an...
متن کاملDynamic Mechanism Design: Incentive Compatibility, Profit Maximization and Information Disclosure
This paper examines the problem of how to design incentive-compatible mechanisms in environments in which the agentsprivate information evolves stochastically over time and in which decisions have to be made in each period. The environments we consider are fairly general in that the agents types are allowed to evolve in a non-Markov way, decisions are allowed to a¤ect the type distributions a...
متن کاملRevenue Equivalence, Prot Maximization, and Transparency in Dynamic Mechanisms
We consider the problem of designing incentive-compatible mechanisms in a general dynamic environment in which agents receive serially correlated private information over time and decisions may be made over time. The private information is assumed independent across agents, and its distribution is allowed to depend on past allocations. We derive a dynamic revenue equivalence result showing that...
متن کاملMechanism Design in M&A Auctions
The recent controversy over “Don’t Ask, Don’t Waive” standstills in M&A practice highlights the need to apply mechanism design to change-of-control transactions. In this Essay, we propose a novel two-stage auction procedure that induces honest bidding among participants while potentially yielding a higher sale price than an open ascending, a sealed-bid first price, or a Vickrey second-price auc...
متن کاملIncentive compatible influence maximization in social networks and application to viral marketing
Information diffusion and influence maximization are important and extensively studied problems in social networks. Various models and algorithms have been proposed in the literature in the context of the influence maximization problem. A crucial assumption in all these studies is that the influence probabilities are known to the social planner. This assumption is unrealistic since the influenc...
متن کامل