Extremal Incentive Compatible Transfers
We characterize the boundaries of the set of transfers implementing a given allocation rule without imposing any assumptions on the agent's type space or utility function besides quasi-linearity. In particular, we characterize the pointwise largest and the pointwise smallest transfer that implement a given allocation rule and are equal to zero at some prespeci ed type (extremal transfers). Exploiting the concept of extremal transfers allows us to obtain an exact characterization of the set of all implementable allocation rules (the set of transfers is non-empty) and the set of allocation rules satisfying Revenue Equivalence (the extremal transfers coincide). Furthermore, we show how the extremal transfers can be put to use in mechanism design problems where Revenue Equivalence does not hold. To this end we rst explore the role of extremal transfers when the agents with type dependent outside options are free to participate in the mechanism. Finally, we consider the question of budget balanced implementation. We show that an allocation rule can be implemented in an incentive compatible, individually rational and ex post budget balanced mechanism if and only if there exists an individually rational extremal transfer scheme that delivers an ex ante budget surplus.
|Date of creation:||2010|
|Contact details of provider:|| Postal: via Rontgen, 1 - 20136 Milano (Italy)|
Web page: http://www.igier.unibocconi.it/
|Order Information:|| Web: http://www.igier.unibocconi.it/en/papers/index.htm Email: |
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Walker, Mark, 1980. "On the Nonexistence of a Dominant Strategy Mechanism for Making Optimal Public Decisions," Econometrica, Econometric Society, vol. 48(6), pages 1521-1540, September.
- Noldeke,G. & Samuelson,L., 2005.
"Optimal bunching without optimal control,"
13, Wisconsin Madison - Social Systems.
- Georg Nöldeke & Larry Samuelson, 2006. "Optimal Bunching without Optimal Control," Working papers 2006/12, Faculty of Business and Economics - University of Basel.
- Georg Noldeke & Larry Samuelson, 2006. "Optimal Bunching without Optimal Control," Levine's Bibliography 784828000000000502, UCLA Department of Economics.
- Roger B. Myerson & Mark A. Satterthwaite, 1981.
"Efficient Mechanisms for Bilateral Trading,"
469S, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Skreta, Vasiliki, 2006. "Mechanism design for arbitrary type spaces," Economics Letters, Elsevier, vol. 91(2), pages 293-299, May.
- Peter Cramton & Robert Gibbons & Paul Klemperer, 1985.
"Dissolving a Partnership Efficiently,"
406, Massachusetts Institute of Technology (MIT), Department of Economics.
- Birgit Heydenreich & Rudolf Müller & Marc Uetz & Rakesh V. Vohra, 2009.
"Characterization of Revenue Equivalence,"
Econometric Society, vol. 77(1), pages 307-316, 01.
- Heydenreich Birgit & Müller Rudolf & Uetz Marc & Vohra Rakesh, 2008. "Characterization of Revenue Equivalence," Research Memorandum 001, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Müller Rudolf & Uetz Marc & Vohra Rakesh & Heydenreich Birgit, 2007. "Characterization of Revenue Equivalence," Research Memorandum 017, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- First:Birgit Heydenreich & Rudolf Muller & Marc Uetz & Rakesh Vohra, 2007. "Characterization of Revenue Equivalence," Discussion Papers 1448, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Steven R. Williams, 1999. "A characterization of efficient, bayesian incentive compatible mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 14(1), pages 155-180.
- Martin Hellwig, 2006.
"Incentive Problems with Unidimensional Hidden Characteristics: A Unified Approach,"
Working Paper Series of the Max Planck Institute for Research on Collective Goods
2006_26, Max Planck Institute for Research on Collective Goods, revised Apr 2010.
- Martin F. Hellwig, 2010. "Incentive Problems With Unidimensional Hidden Characteristics: A Unified Approach," Econometrica, Econometric Society, vol. 78(4), pages 1201-1237, 07.
- Matsuo, Toshihide, 1989. "On incentive compatible, individually rational, and ex post efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 49(1), pages 189-194, October.
- Paul Milgrom & Ilya Segal, 2002. "Envelope Theorems for Arbitrary Choice Sets," Econometrica, Econometric Society, vol. 70(2), pages 583-601, March.
- Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, EconWPA, revised 28 Apr 1998.
- Makowski Louis & Mezzetti Claudio, 1994. "Bayesian and Weakly Robust First Best Mechanisms: Characterizations," Journal of Economic Theory, Elsevier, vol. 64(2), pages 500-519, December.
- William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, 03.
- Segal, Ilya R. & Whinston, Michael D., 2011. "A simple status quo that ensures participation (with application to efficient bargaining)," Theoretical Economics, Econometric Society, vol. 6(1), January.
- Olszewski, Wojciech & Chung, Kim-Sau, 2007. "A non-differentiable approach to revenue equivalence," Theoretical Economics, Econometric Society, vol. 2(4), December.
- Rochet, Jean-Charles, 1987. "A necessary and sufficient condition for rationalizability in a quasi-linear context," Journal of Mathematical Economics, Elsevier, vol. 16(2), pages 191-200, April.
When requesting a correction, please mention this item's handle: RePEc:igi:igierp:359. 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: ()
If references are entirely missing, you can add them using this form.