Mierendorff, Konrad: Essays on Dynamic Mechanism Design. - Bonn, 2010. - Dissertation, Rheinische Friedrich-Wilhelms-Universität Bonn.
Online-Ausgabe in bonndoc: https://nbn-resolving.org/urn:nbn:de:hbz:5-21833
urn: https://nbn-resolving.org/urn:nbn:de:hbz:5-21833,
author = {{Konrad Mierendorff}},
title = {Essays on Dynamic Mechanism Design},
school = {Rheinische Friedrich-Wilhelms-Universität Bonn},
year = 2010,
month = jul,

note = {We consider the allocation of one or several units of a good in a dynamic environment. The time horizon is finite and in each period, a random number of potential buyers arrives. In Chapter 1, we study revenue maximization in an environment where buyers are privately informed about their valuations and their deadlines. Depending on the type distribution, the incentive compatibility constraint for the deadline may or may not be binding in the optimal mechanism. We identify a static and a dynamic pricing effect that drive incentive compatibility and violations thereof. Both effects are related to distinct properties of the type distribution and sufficient conditions are given under which each effect leads to a binding or slack incentive constraint for the deadline. An optimal mechanism for the binding case is derived for the special case of one object, two periods and two buyers. It can be implemented by a fixed price in period one and an asymmetric auction in period two. In order to prevent buyer one from buying in the first period when his deadline is two, the seller sets a reserve price that is lower than in the classic (Myerson, 1981) optimal auction and gives him a (non-linear) bonus. The bonus leads to robust bunching at the top of the type-space. Chapter 2 contains a characterization of asymmetric reduced form auctions. In chapter 3, we consider a more general dynamic environment in which buyers' valuations may depend on the time of allocation in an arbitrary way. We show that the static Vickrey auction can be generalized to the dynamic framework. This yields a simple payment rule for the implementation of the efficient allocation rule of a single object. To define the dynamic Vickrey auction, we show that the multi-dimensional type-space can be reduced to essentially one dimension. This allows to define the winner's payment as the lowest valuation in the reduced type-space, that suffices to win. Finally we define an ascending clock-auction with an equilibrium-outcome that coincides with the outcome of the dynamic Vickrey auction.},
url = {https://hdl.handle.net/20.500.11811/4275}

Die folgenden Nutzungsbestimmungen sind mit dieser Ressource verbunden: