On the Uniqueness of Bayesian Coarse Correlated Equilibria in Standard First-Price and All-Pay Auctions
Mete Seref Ahunbay, Martin Bichler
Abstract
We study the Bayesian coarse correlated equilibrium (BCCE) of continuous and discretised first-price and all-pay auctions under the standard symmetric independent private-values model. Our study is motivated by the question of how the canonical Bayes-Nash equilibrium (BNE) of the auction relates to the outcomes learned by buyers utilising no-regret algorithms. Numerical experiments show that in two buyer first-price auctions the Wasserstein-2 distance of buyers' marginal bid distributions decline as O(1/n) in the discretisation size in instances where the prior distribution is concave, whereas all-pay auctions exhibit similar behaviour without prior dependence. To explain this convergence to a near-equilibrium, we study uniqueness of the BCCE of the continuous auction. Our uniqueness results translate to provable convergence of deterministic self-play to a near equilibrium outcome in these auctions. In the all-pay auction, we show that independent of the prior distribution there is a unique BCCE with symmetric, differentiable, and increasing bidding strategies, which is equivalent to the unique strict BNE. In the first-price auction, we need stronger conditions. Either the prior is strictly concave or the learning algorithm has to be restricted to strictly increasing strategies. Without such strong assumptions, no-regret algorithms can end up in low-price pooling strategies. This is important because it proves that in repeated first-price auctions such as in display ad actions, algorithmic collusion cannot be ruled out without further assumptions even if all bidders rely on no-regret algorithms.
- A first version of this paper appeared on ArXiV on January 2 nd , 2024, and a second version on June 20th. The current version incorporates reviewer feedback following acceptance to SODA'25.
1 That is, before considering deviations to a bid, they should know their own valuation for the item.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers5
- Nash Convergence of Mean-Based Learning Algorithms in First Price AuctionsXiaotie Deng, Xinyan Hu, Tao Lin, Weiqiang ZhengWWW 2022 · 16 citations
- First-Order (Coarse) Correlated Equilibria in Non-concave GamesMete Seref AhunbaySTOC 2026 · 6 citations
- Deep Reinforcement Learning Finds Bayes-Nash Equilibrium in Competitive Newsvendor ProblemsKassian Köck, Fabian Raoul Pieroth, Martin BichlerICML 2026
- Revenue Efficiency of Correlated Equilibria in First Price AuctionsAnders Bo Ipsen, Stratis SkoulakisICML 2026
- Learning Bayesian Nash Equilibrium in Auction Games via Approximate Best ResponseKexin Huang, Ziqian Chen, Xue Wang, Chongming Gao et al.ICML 2025
Builds on7
- Tight last-iterate convergence rates for no-regret learning in multi-player gamesNoah Golowich, Sarath Pattathil, Constantinos DaskalakisNeurIPS 2020 · 100 citations
- Finite-Time Last-Iterate Convergence for Learning in Multi-Player GamesYang Cai, Argyris Oikonomou, Weiqiang ZhengNeurIPS 2022 · 63 citations
- Auctions between Regret-Minimizing AgentsYoav Kolumbus, Noam NisanWWW 2022 · 47 citations
- Convergence Analysis of No-Regret Bidding Algorithms in Repeated AuctionsZhe Feng, Guru Guruganesh, Christopher Liaw, Aranyak Mehta et al.AAAI 2021 · 31 citations
- Nash Convergence of Mean-Based Learning Algorithms in First Price AuctionsXiaotie Deng, Xinyan Hu, Tao Lin, Weiqiang ZhengWWW 2022 · 16 citations
Related papers
- Beyond Monotonicity: On the Convergence of Learning Algorithms in Standard Auction GamesMartin Bichler, Stephan B. Lunowa, Matthias Oberlechner, Fabian R. Pieroth et al.AAAI 2025 · 5 citations
- Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix GamesIoannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas SandholmNeurIPS 2022 · 14 citations
- Randomized Truthful Auctions with Learning AgentsGagan Aggarwal, Anupam Gupta, Andrés Perlroth, Grigoris VelegkasNeurIPS 2024 · 3 citations
- The Price of Stability for First Price AuctionYaonan Jin, Pinyan LuSODA 2023 · 3 citations
- Simultaneous 2nd Price Item Auctions with No-UnderbiddingMichal Feldman, Galia ShabtaiAAAI 2021 · 2 citations
