This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

A non-differentiable approach to revenue equivalence

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Olszewski, Wojciech () (Northwestern University)
Chung, Kim-Sau () (University of Minnesota)

Additional information is available for the following registered author(s):

Abstract

We give a sufficient condition on the type space for revenue equivalence when the set of social alternatives consists of probability distributions over a finite set. Types are identified with real-valued functions that assign valuations to elements of this finite set, and the type space is equipped with the Euclidean topology. Our sufficient condition is stronger than connectedness but weaker than smooth arcwise connectedness. Our result generalizes all existing revenue equivalence theorems when the set of social alternatives consists of probability distributions over a finite set. When the set of social alternatives is finite, we provide a necessary and sufficient condition. This condition is similar to, but slightly weaker than, connectedness.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://econtheory.org/ojs/index.php/te/article/view/20070469/67
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Article provided by Society for Economic Theory in its journal Theoretical Economics.

Volume (Year): 2 (2007)
Issue (Month): 4 (December)
Pages: 469-487
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:the:publsh:277

Contact details of provider:
Web page: http://econtheory.org

For technical questions regarding this item, or to correct its listing, contact: (Martin J. Osborne).

Related research
Keywords: Revenue equivalence; mechanism design; incentive compatibility; non-differentiable approach; connected type space;

Find related papers by JEL classification:
C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information

Cited by:
(explanations, 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.)

  1. 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. [Downloadable!]
    Other versions:
  2. Svaiter, Benar Fux & Monteiro, Paulo Klinger, 2008. "Optimal auction with a general distribution: virtual valuation without densities," Economics Working Papers (Ensaios Economicos da EPGE) 681, Graduate School of Economics, Getulio Vargas Foundation (Brazil). [Downloadable!]
Statistics
Access and download statistics

Did you know? About 1000 archives contribute their bibliographic data to RePEc.

This page was last updated on 2009-11-14.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.