IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1105.0819.html
   My bibliography  Save this paper

Equilibrium strategy and population-size effects in lowest unique bid auctions

Author

Listed:
  • Simone Pigolotti
  • Sebastian Bernhardsson
  • Jeppe Juul
  • Gorm Galster
  • Pierpaolo Vivo

Abstract

In lowest unique bid auctions, $N$ players bid for an item. The winner is whoever places the \emph{lowest} bid, provided that it is also unique. We use a grand canonical approach to derive an analytical expression for the equilibrium distribution of strategies. We then study the properties of the solution as a function of the mean number of players, and compare them with a large dataset of internet auctions. The theory agrees with the data with striking accuracy for small population size $N$, while for larger $N$ a qualitatively different distribution is observed. We interpret this result as the emergence of two different regimes, one in which adaptation is feasible and one in which it is not. Our results question the actual possibility of a large population to adapt and find the optimal strategy when participating in a collective game.

Suggested Citation

  • Simone Pigolotti & Sebastian Bernhardsson & Jeppe Juul & Gorm Galster & Pierpaolo Vivo, 2011. "Equilibrium strategy and population-size effects in lowest unique bid auctions," Papers 1105.0819, arXiv.org, revised Feb 2012.
    • Handle: RePEc:arx:papers:1105.0819
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1105.0819
    File Function: Latest version
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Cancan Zhou & Hongguang Dong & Rui Hu & Qinghua Chen, 2015. "Smarter than Others? Conjectures in Lowest Unique Bid Auctions," PLOS ONE, Public Library of Science, vol. 10(4), pages 1-13, April.
    2. Rui Hu & Jinzhong Guo & Qinghua Chen & Tao Zheng, 2017. "The Psychological Force Model for Lowest Unique Bid Auction," Computational Economics, Springer;Society for Computational Economics, vol. 50(4), pages 655-667, December.
    3. Berger, Ulrich & De Silva, Hannelore & Fellner-Röhling, Gerlinde, 2016. "Cognitive hierarchies in the minimizer game," Journal of Economic Behavior & Organization, Elsevier, vol. 130(C), pages 337-348.
    4. Nadir Altinok & Abdurrahman Aydemir, 2015. "The Unfolding of Gender Gap in Education," Working Papers 934, Economic Research Forum, revised Aug 2015.
    5. Mohlin, Erik & Östling, Robert & Wang, Joseph Tao-yi, 2015. "Lowest unique bid auctions with population uncertainty," Economics Letters, Elsevier, vol. 134(C), pages 53-57.
    6. Arvind Srinivasan & Burton Simon, 2024. "Exact asymptotics and continuous approximations for the Lowest Unique Positive Integer game," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(2), pages 653-671, June.
    7. Yamada, Takashi & Hanaki, Nobuyuki, 2016. "An experiment on Lowest Unique Integer Games," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 88-102.
    8. Erik Mohlin & Robert Ostling & Joseph Tao-yi Wang, 2014. "Learning by Imitation in Games: Theory, Field, and Laboratory," Economics Series Working Papers 734, University of Oxford, Department of Economics.
    9. Mohlin, Erik & Östling, Robert & Wang, Joseph Tao-yi, 2020. "Learning by similarity-weighted imitation in winner-takes-all games," Games and Economic Behavior, Elsevier, vol. 120(C), pages 225-245.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:1105.0819. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.