Learning, mean field approximations, and phase transitions in auction models (Q6556815)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Learning, mean field approximations, and phase transitions in auction models |
scientific article; zbMATH DE number 7866589
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Learning, mean field approximations, and phase transitions in auction models |
scientific article; zbMATH DE number 7866589 |
Statements
Learning, mean field approximations, and phase transitions in auction models (English)
0 references
17 June 2024
0 references
In this article, the authors study an agent-based model for multi-round, pay as bid, sealed bid reverse auctions using techniques from partial differential equations and statistical mechanics tools under the assumption that in each round a fixed fraction of bidders is awarded, and bidders learn from round to round using simple microscopic rules, adjusting myopically their bid according to their performance.\N\NThe problem of an unadvertised agreement between buyers of non-exclusive rights at a spectrum auction for the agreed formation of price bids is considered from the viewpoint of game theory and operations research. The simulations show that bidders coordinate in the sense that they tend to bid the same value in the long-time limit. In Section 6 the authors analyze the case of a heterogeneous cost distribution among the bidders showing that the phase transition at \(\rho = 2\) persists in this more general setting. When \(\rho = 2\), an exact formula for the final mean price involving the cost distribution is obtained heuristically building on the intuition developed so far, and which agrees very well with the simulations.
0 references
auctions
0 references
agent-based models
0 references
learning
0 references
kinetic models
0 references
0 references
0 references