Auctioneer's Discretion in Combinatorial Auctions
AbstractWe argue that in order to achieve the VCG outcomes in combinatorial auctions, the auctioneer does not need to make a full contractual agreement on the protocol with participants. We can leave the detail of its design to the auctioneer's discretion. The auctioneer can even make it contingent on unverifiable information. We consider general dynamical protocols termed price-demand procedures, and introduce representative valuation functions, which are, with connectedness and revealed preferences, calculated easily from the occurred history. It is sufficient to examine whether the efficient allocations with and without any single buyer associated with the representative valuation functions were revealed.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
Bibliographic InfoPaper provided by Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo in its series CARF F-Series with number CARF-F-293.
Length: 22 pages
Date of creation: Jan 2010
Date of revision: Sep 2012
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.:
- Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
- MISHRA, Debasis & PARKES, David C., 2005.
"Ascending price Vickrey auctions for general valuations,"
CORE Discussion Papers
2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
- Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521536721, October.
- Hitoshi Matsushima, 2007.
"Detail-Free Mechanism Design in Twice Iterative Dominance: Large Economies,"
CIRJE-F-519, CIRJE, Faculty of Economics, University of Tokyo.
- Matsushima, Hitoshi, 2008. "Detail-free mechanism design in twice iterative dominance: Large economies," Journal of Economic Theory, Elsevier, vol. 141(1), pages 134-151, July.
- Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
- Mas-Colell, Andreu & Whinston, Michael D. & Green, Jerry R., 1995. "Microeconomic Theory," OUP Catalogue, Oxford University Press, number 9780195102680.
- Hitoshi Matsushima, 2011.
"Price-Based Combinatorial Auction: Connectedness and Representative Valuations,"
CARF-F-261, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
- Hitoshi Matsushima, 2011. "Price-Based Combinatorial Auction: Connectedness and Representative Valuations," CIRJE F-Series CIRJE-F-806, CIRJE, Faculty of Economics, University of Tokyo.
- Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
- Hitoshi Matsushima, 2004.
"On Detail-Free Mechanism Design and Rationality,"
CARF-F-010, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
- Hitoshi Matsushima, 2010.
"Price-Based Combinatorial Auction Design: Representative Valuations,"
CIRJE-F-776, CIRJE, Faculty of Economics, University of Tokyo.
- Hitoshi Matsushima, 2010. "Price-Based Combinatorial Auction Design: Representative Valuations," KIER Working Papers 742, Kyoto University, Institute of Economic Research.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.