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! ]

Optimal Shill Bidding in the VCG Mechanism

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Itai Sher () (Department of Economics, University of Minnesota)

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

Abstract

This paper studies shill bidding in the VCG mechanism applied to combinatorial auctions. Shill bidding is a strategy whereby a single decision-maker enters the auction under the guise of multiple identities (Sakurai, Yokoo, and Matsubara 1999). I formulate the problem of optimal shill bidding for a bidder who knows the aggregate bid of her opponents. A key to the analysis is a subproblem--the cost minimization problem (CMP)--which searches for the cheapest way to win a given package using shills. An analysis of the CMP leads to several fundamental results about shill bidding: (i) I provide an exact characterization of the aggregate bids b such that some bidder would have an incentive to shill bid against b in terms of a new property, Submodularity at the Top; (ii) the problem of optimally sponsoring shills is equivalent to the winner determination problem (for single minded bidders)--the problem of finding an efficient allocation in a combinatorial auction; (iii) shill bidding can occur in equilibrium; and (iv) the problem of shill bidding has an inverse, namely the collusive problem that a coalition of bidders may have an incentive to merge (even after competition among coalition members has been suppressed). I show that only when valuations are additive can the incentives to shill and merge simultaneously disappear.

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://www.econ.umn.edu/merr/2008_4.pdf
File Format: application/pdf
File Function: First version, 2008
Download Restriction: no

Publisher Info
Paper provided by University of Minnesota, Department of Economics in its series Working Papers with number 2008-4.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 52 pages
Date of creation: 12 2008
Date of revision: 05 2009
Handle: RePEc:min:wpaper:2008-4

Contact details of provider:
Postal: 4-101 Hanson Hall, 1925 Fourth Street South, Minneapolis, MN 55455
Phone: (612)625-6353
Fax: (612)624-0209
Email:
Web page: http://www.econ.umn.edu/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Caty Bach).

Related research
Keywords: VCG mechanism; combinatorial auctions; winner determination problem; collusion.;

Find related papers by JEL classification:
C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
D44 - Microeconomics - - Market Structure and Pricing - - - Auctions

This paper has been announced in the following NEP Reports:

References listed on IDEAS
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. Gul, Faruk & Stacchetti, Ennio, 1999. "Walrasian Equilibrium with Gross Substitutes," Journal of Economic Theory, Elsevier, vol. 87(1), pages 95-124, July. [Downloadable!] (restricted)
  2. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April. [Downloadable!] (restricted)
    Other versions:
  3. Moulin, Hervé, 2008. "Proportional scheduling, split-proofness, and merge-proofness," Games and Economic Behavior, Elsevier, vol. 63(2), pages 567-587, July. [Downloadable!] (restricted)
  4. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn. [Downloadable!] (restricted)
  5. Green, Jerry & Laffont, Jean-Jacques, 1977. "Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods," Econometrica, Econometric Society, vol. 45(2), pages 427-38, March. [Downloadable!] (restricted)
  6. Lehmann, Benny & Lehmann, Daniel & Nisan, Noam, 2006. "Combinatorial auctions with decreasing marginal utilities," Games and Economic Behavior, Elsevier, vol. 55(2), pages 270-296, May. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? All the bibliographic data shown here has been contributed by volunteers, thereby helping to keep this service free.

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


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.