Sequentially Optimal Mechanisms<xref ref-type="fn" rid="FN1">-super-1</xref>
This paper establishes that posting a price in each period is a revenue-maximizing allocation mechanism in a finite period model without commitment. A risk-neutral seller has one object to sell and faces a risk-neutral buyer whose valuation is private information and drawn from an arbitrary bounded subset of the real line. The seller has all the bargaining power: she designs a mechanism to sell the object at t, but if trade does not occur at t she can propose another mechanism at t + 1. We show that posting a price in each period is an optimal mechanism. A methodological contribution of the paper is to develop a procedure to characterize optimal dynamic incentive schemes under non-commitment that is valid irrespective of the structure of the agent's type. Copyright 2006, Wiley-Blackwell.
Year of publication: |
2006
|
---|---|
Authors: | Skreta, Vasiliki |
Published in: |
Review of Economic Studies. - Oxford University Press. - Vol. 73.2006, 4, p. 1085-1111
|
Publisher: |
Oxford University Press |
Saved in:
Saved in favorites
Similar items by person
-
On the informed seller problem : optimal information disclosure
Skreta, Vasiliki, (2008)
-
Optimal auctions with general distributions
Skreta, Vasiliki, (2007)
-
Optimal auction design under non-commitment
Skreta, Vasiliki, (2007)
- More ...