Explaining the Law of Supply and Demand via Online Learning
Stratis Skoulakis
Abstract
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.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7baced8e-339b-409b-862e-467332365959Builds on5
- Uncoupled Learning Dynamics with O(log T) Swap Regret in Multiplayer GamesIoannis Anagnostides, Gabriele Farina, Christian Kroer, Chung-Wei Lee et al.NeurIPS 2022 · 51 citations
- Near-optimal no-regret learning for correlated equilibria in multi-player general-sum gamesIoannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson et al.STOC 2022 · 16 citations
- No-regret Learning in Price Competitions under Consumer Reference EffectsNegin Golrezaei, Patrick Jaillet, Jason Cheuk Nam LiangNeurIPS 2020 · 14 citations
- Asynchronous Proportional Response Dynamics: Convergence in Markets with Adversarial SchedulingYoav Kolumbus, Menahem Levy, Noam NisanNeurIPS 2023 · 9 citations
- Online Learning in Betting Markets: Profit versus PredictionHaiqing Zhu, Alexander Soen, Yun Kuen Cheung, Lexing XieICML 2024 · 2 citations
Related papers
- 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 citations
- Nash Convergence of Mean-Based Learning Algorithms in First Price AuctionsXiaotie Deng, Xinyan Hu, Tao Lin, Weiqiang ZhengWWW 2022 · 16 citations
- No-Regret Learning in Dynamic Competition with Reference Effects Under Logit DemandMengzi Amy Guo, Donghao Ying, Javad Lavaei, Zuo-Jun Max ShenNeurIPS 2023 · 1 citation
- A Parametric Contextual Online Learning Theory of BrokerageFrançois Bachoc, Tommaso Cesari, Roberto ColomboniICML 2025
