Advanced Search
MyIDEAS: Login

Least Unmatched Price Auctions: A First Approach

Contents:

Author Info

  • Jürgen Eichberger

    ()
    (University of Heidelberg, Department of Economics)

  • Dmitri Vinogradov

    ()
    (University of Essex, Essex Business School,)

Abstract

Least-Unmatched Price Auctions have become a popular format of TV and radio shows. Increasingly, they are also applied in internet trading. In these auctions the lowest single (unique) bid wins. We analyze the game-theoretic solution of least unmatched price auctions when prize, bidding cost and the number of participants are known. We use a large data-set of such auctions in order to contrast actual behavior of players with game-theoretic predictions. In the aggregate, bidding behaviour seems to conform with a Nash equilibrium in mixed strategies.

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://www.uni-heidelberg.de/md/awi/forschung/dp471.pdf
Download Restriction: no

Bibliographic Info

Paper provided by University of Heidelberg, Department of Economics in its series Working Papers with number 0471.

as in new window
Length: 33 pages
Date of creation: Jul 2008
Date of revision: Jul 2008
Handle: RePEc:awi:wpaper:0471

Contact details of provider:
Postal: Grabengasse 14, D-69117 Heidelberg
Phone: +49-6221-54 2905
Fax: +49-6221-54 2914
Email:
Web page: http://www.awi.uni-heidelberg.de/
More information through EDIRC

Related research

Keywords: games; experiments;

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. Jacob K. Goeree & Charles A. Holt, 2000. "Ten Little Treasures of Game Theory and Ten Intuitive Contradictions," Virginia Economics Online Papers 333, University of Virginia, Department of Economics.
  2. Antoni Bosch-Dom�nech & Jos� G. Montalvo & Rosemarie Nagel & Albert Satorra, 2002. "One, Two, (Three), Infinity, ...: Newspaper and Lab Beauty-Contest Experiments," American Economic Review, American Economic Association, vol. 92(5), pages 1687-1701, December.
  3. Ockenfels, Axel & Roth, Alvin E., 2006. "Late and multiple bidding in second price Internet auctions: Theory and evidence concerning different rules for ending an auction," Games and Economic Behavior, Elsevier, vol. 55(2), pages 297-320, May.
  4. Metrick, Andrew, 1995. "A Natural Experiment in "Jeopardy!"," American Economic Review, American Economic Association, vol. 85(1), pages 240-53, March.
  5. Kate Antonovics & Peter Arcidiacono & Randall Walsh, 2005. "Games and Discrimination: Lessons From The Weakest Link," Journal of Human Resources, University of Wisconsin Press, vol. 40(4), pages 918-947.
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. 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.
  2. Andrea Gallice, 2010. "Price Reveal Auctions on the Internet," Carlo Alberto Notebooks 147, Collegio Carlo Alberto.
  3. Robert �stling & Joseph Tao-yi Wang & Eileen Y. Chou & Colin F. Camerer, 2011. "Testing Game Theory in the Field: Swedish LUPI Lottery Games," American Economic Journal: Microeconomics, American Economic Association, vol. 3(3), pages 1-33, August.
  4. Andrea Gallice, 2012. "Price Reveal Auctions," Working papers 015, Department of Economics and Statistics (Dipartimento di Scienze Economico-Sociali e Matematico-Statistiche), University of Torino.
  5. Raviv, Yaron & Virag, Gabor, 2009. "Gambling by auctions," International Journal of Industrial Organization, Elsevier, vol. 27(3), pages 369-378, May.
  6. Marco Scarsini & Eilon Solan & Nicolas Vieille, 2010. "Lowest Unique Bid Auctions," Papers 1007.4264, arXiv.org.
  7. Robert Ostling & Joseph T Wang & Eileen Chou & Colin F Camerer, 2007. "Field and Lab Convergence in Poisson LUPI games," Levine's Bibliography 122247000000001530, UCLA Department of Economics.
  8. Harold Houba & Dinard van der Laan & Dirk Veldhuizen, 2008. "The Unique-lowest Sealed-bid Auction," Tinbergen Institute Discussion Papers 08-049/1, Tinbergen Institute.
  9. Di Gaetano, Luigi, 2011. "A model of descending auction with hidden starting price and endogenous price decrease," MPRA Paper 35773, University Library of Munich, Germany.

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:awi:wpaper:0471. 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: (Gabi Rauscher).

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.