Arbeitspapier

Unique bid auction games

Two auction mechanisms are studied in which players compete with one another for an exogenously determined prize by independently submitting integer bids in some discrete and commonly known strategy space specified by the auctioneer. In the unique lowest (highest) bid auction game, the winner of the prize is the player who submits the lowest (highest) bid provided that this bid is unique, i.e., unmatched by other bids. Assuming a commonly known finite population of players, a non-negative cost of entry, and an option to stay out of the auction if the entry cost is deemed too high, we propose an algorithm for computing symmetric mixed-strategy equilibrium solutions to the two variants of the auction game, illustrate them, and examine their properties.

Sprache
Englisch

Erschienen in
Series: Jena Economic Research Papers ; No. 2009,005

Klassifikation
Wirtschaft
Noncooperative Games
Auctions
Thema
Unique bid auction games
equilibrium analysis
Auktionstheorie
Nichtkooperatives Spiel
Gleichgewicht
Theorie

Ereignis
Geistige Schöpfung
(wer)
Rapoport, Amnon
Otsubo, Hironori
Kim, Bora
Stein, William E.
Ereignis
Veröffentlichung
(wer)
Friedrich Schiller University Jena and Max Planck Institute of Economics
(wo)
Jena
(wann)
2009

Handle
Letzte Aktualisierung
10.03.2025, 11:44 MEZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Objekttyp

  • Arbeitspapier

Beteiligte

  • Rapoport, Amnon
  • Otsubo, Hironori
  • Kim, Bora
  • Stein, William E.
  • Friedrich Schiller University Jena and Max Planck Institute of Economics

Entstanden

  • 2009

Ähnliche Objekte (12)