Explaining the Law of Supply and Demand via Online Learning
Stratis Skoulakis
摘要
The law of supply and demand asserts that in a perfectly competitive market, the price of a good adjusts to a market clearing price . In a market clearing price p ⋆ the number of sellers willing to sell the good at p ⋆ equals the number of sellers willing to buy the good at price p ⋆ . In this work, we provide a mathematical foundation on the law of supply and demand through the lens of online learning. Specifically, we demonstrate that if each seller employs a no-swap regret algorithm to set their individual selling price—aiming to maximize its individual revenue—the collective pricing dynamics converge to the market-clearing price p ⋆ . Our findings offer a novel perspective on the law of supply and demand, framing it as the emergent outcome of an adaptive learning processes among sellers.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper5
- Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer GamesIoannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee 等NeurIPS 2022 · 被引用 51 次
- Near-optimal no-regret learning for correlated equilibria in multi-player general-sum gamesIoannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson 等STOC 2022 · 被引用 16 次
- No-regret Learning in Price Competitions under Consumer Reference EffectsNegin Golrezaei, Patrick Jaillet, Jason Cheuk Nam LiangNeurIPS 2020 · 被引用 14 次
- Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial SchedulingYoav Kolumbus, Menahem Levy, Noam NisanNeurIPS 2023 · 被引用 9 次
- Online Learning in Betting Markets: Profit versus PredictionHaiqing Zhu, Alexander Soen, Yun Kuen Cheung, Lexing XieICML 2024 · 被引用 2 次
相关 Paper
- Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret LearnersARNAB MAITI, Junyan Liu, Kevin Jamieson, Lillian RatliffICML 2026
- Online Learning in the Repeated Mediated Newsvendor ProblemNatasa Bolic, Tommaso Cesari, Roberto Colomboni, Christian ParavalosNeurIPS 2025 · 被引用 2 次
- Nash Convergence of Mean-Based Learning Algorithms in First Price AuctionsXiaotie Deng, Xinyan Hu, Tao Lin, Weiqiang ZhengWWW 2022 · 被引用 16 次
- No-Regret Learning in Dynamic Competition with Reference Effects Under Logit DemandMengzi Amy Guo, Donghao Ying, Javad Lavaei, Zuo-Jun Max ShenNeurIPS 2023 · 被引用 1 次
- A Parametric Contextual Online Learning Theory of BrokerageFrançois Bachoc, Tommaso Cesari, Roberto ColomboniICML 2025
