Advanced Search
MyIDEAS: Login

Unique bid auctions: Equilibrium solutions and experimental evidence

Contents:

Author Info

  • Rapoport, Amnon
  • Otsubo, Hironori
  • Kim, Bora
  • Stein, William E.

Abstract

Two types of auction were introduced on the Internet a few years ago and have rapidly been gaining widespread popularity. In both auctions, players compete for an exogenously determined prize by independently choosing an integer in some finite and common strategy space specified by the auctioneer. In the unique lowest (highest) bid auction, the winner of the prize is the player who submits the lowest (highest) bid, provided that it is unique. We construct the symmetric mixed-strategy equilibrium solutions to the two auctions, and then test them in a sequence of experiments that vary the number of bidders and size of the strategy space. Our results show that the aggregate bids, but only a minority of the individual bidders, are accounted for quite accurately by the equilibrium solutions.

Download Info

If 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.
File URL: http://mpra.ub.uni-muenchen.de/4185/
File Function: original version
Download Restriction: no

Bibliographic Info

Paper provided by University Library of Munich, Germany in its series MPRA Paper with number 4185.

as in new window
Length:
Date of creation: 16 Jul 2007
Date of revision: 17 Jul 2007
Handle: RePEc:pra:mprapa:4185

Contact details of provider:
Postal: Schackstr. 4, D-80539 Munich, Germany
Phone: +49-(0)89-2180-2219
Fax: +49-(0)89-2180-3900
Web page: http://mpra.ub.uni-muenchen.de
More information through EDIRC

Related research

Keywords: unique bid auctions; equilibrium analysis; experiment;

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

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.:
as in new window
  1. Axel Ockenfels & David Reiley & Abdolkarim Sadrieh, 2006. "Online Auctions," NBER Working Papers 12785, National Bureau of Economic Research, Inc.
  2. Raviv, Yaron & Virag, Gabor, 2009. "Gambling by auctions," International Journal of Industrial Organization, Elsevier, vol. 27(3), pages 369-378, May.
  3. Patrick Bajari & Ali Horta�su, 2004. "Economic Insights from Internet Auctions," Journal of Economic Literature, American Economic Association, vol. 42(2), pages 457-486, June.
  4. Rapoport, Amnon & Stein, William E. & Parco, James E. & Seale, Darryl A., 2004. "Equilibrium play in single-server queues with endogenously determined arrival times," Journal of Economic Behavior & Organization, Elsevier, vol. 55(1), pages 67-91, September.
  5. Ivanova-Stenzel, Radosveta & Sonsino, Doron, 2004. "Comparative study of one-bid versus two-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 54(4), pages 561-583, August.
  6. Rapoport, Amnon & Seale, Darryl A. & Winter, Eyal, 2002. "Coordination and Learning Behavior in Large Groups with Asymmetric Players," Games and Economic Behavior, Elsevier, vol. 39(1), pages 111-136, April.
  7. Darryl Seale & Amnon Rapoport, 2000. "Elicitation of Strategy Profiles in Large Group Coordination Games," Experimental Economics, Springer, vol. 3(2), pages 153-179, October.
  8. Theodore Turocy & Elizabeth Watson & Raymond Battalio, 2007. "Framing the first-price auction," Experimental Economics, Springer, vol. 10(1), pages 37-51, March.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Andrea Gallice, 2008. "Lowest Unique Bid Auctions over the Internet: Ability, Lottery or Scam?," Department of Economic Policy, Finance and Development (DEPFID) University of Siena 0608, Department of Economic Policy, Finance and Development (DEPFID), University of Siena.
  2. Harold Houba & Dinard Laan & Dirk Veldhuizen, 2011. "Endogenous entry in lowest-unique sealed-bid auctions," Theory and Decision, Springer, vol. 71(2), pages 269-295, August.
  3. Toomas Hinnosaar, 2013. "Penny Auctions are Unpredictable," Carlo Alberto Notebooks 305, Collegio Carlo Alberto.
  4. Raviv, Yaron & Virag, Gabor, 2009. "Gambling by auctions," International Journal of Industrial Organization, Elsevier, vol. 27(3), pages 369-378, May.
  5. Harold Houba & Dinard van der Laan & Dirk Veldhuizen, 2008. "The Unique-lowest Sealed-bid Auction," Tinbergen Institute Discussion Papers 08-049/1, Tinbergen Institute.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:4185. 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: (Ekkehart Schlicht).

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.