A Subsidized Vickrey Auction for Cost Sharing
We introduce a subsidized Vickrey auction for cost sharing problems. Although the average, marginal, and serial cost sharing mechanisms are budget-balanced, they are not allocatively efficient and they do not induce players to truthfully reveal their values as a dominant strategy. The conventional Vickrey auction, on the other hand, is allocatively efficient and does induce truthful bidding as a dominant strategy, but also generates an overpayment. This paper modifies the conventional Vickrey auction so that some of the overpayment is used to subsidize additional production without upsetting the players' incentives to bid truthfully. Although this subsidized Vickrey auction is not allocatively efficient, it always Pareto dominates the conventional Vickrey auction and sometimes dominates other existing cost sharing mechanisms.
|Date of creation:||Apr 2007|
|Date of revision:|
|Contact details of provider:|| Web page: http://www.vanderbilt.edu/econ/wparchive/index.html|
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.:
- McAfee, R. Preston., 1990.
"A Dominant Strategy Double Auction,"
734, California Institute of Technology, Division of the Humanities and Social Sciences.
- McAfee, R. Preston & McMillan, John., 1990.
726, California Institute of Technology, Division of the Humanities and Social Sciences.
- Eric Friedman & Moulin, Herve, 1995.
"Three Methods to Share Joint Costs or Surplus,"
95-38, Duke University, Department of Economics.
- Laura Razzolini & Michael Reksulak & Robert Dorsey, 2004.
"An Experimental Evaluation of the Serial Cost Sharing Rule,"
0402, VCU School of Business, Department of Economics.
- Laura Razzolini & Michael Reksulak & Robert Dorsey, 2007. "An Experimental Evaluation of the Serial Cost Sharing Rule," Theory and Decision, Springer, vol. 63(3), pages 283-314, November.
- Lawrence M. Ausubel & Peter Cramton & Marek Pycia & Marzena Rostek & Marek Weretka, 2014.
"Demand Reduction and Inefficiency in Multi-Unit Auctions,"
Review of Economic Studies,
Oxford University Press, vol. 81(4), pages 1366-1400.
- Lawrence M. Ausubel & Peter Cramton, 1995. "Demand Reduction and Inefficiency in Multi-Unit Auctions," Papers of Peter Cramton 98wpdr, University of Maryland, Department of Economics - Peter Cramton, revised 22 Jul 2002.
- Lawrence M. Ausubel & Paul Milgrom, 2002.
"Ascending Auctions with Package Bidding,"
02004, Stanford University, Department of Economics.
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521536721.
- Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer, vol. 18(3), pages 511-533.
- Paul Milgrom & Robert J. Weber, 1981.
"A Theory of Auctions and Competitive Bidding,"
447R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Moulin, Herve & Shenker, Scott, 1992. "Serial Cost Sharing," Econometrica, Econometric Society, vol. 60(5), pages 1009-37, September.
- Moulin Herve & Shenker Scott, 1994. "Average Cost Pricing versus Serial Cost Sharing: An Axiomatic Comparison," Journal of Economic Theory, Elsevier, vol. 64(1), pages 178-201, October.
- d'Aspremont, Claude & Gerard-Varet, Louis-Andre, 1979. "Incentives and incomplete information," Journal of Public Economics, Elsevier, vol. 11(1), pages 25-45, February.
- Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
When requesting a correction, please mention this item's handle: RePEc:van:wpaper:0705. 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: (John P. Conley)
If references are entirely missing, you can add them using this form.