后悔
计算机科学
竞赛(生物学)
趋同(经济学)
适应性学习
纳什均衡
动态定价
基础(证据)
国家(计算机科学)
强化学习
数学优化
运筹学
微观经济学
经济
人工智能
数理经济学
适应性策略
理论(学习稳定性)
结果(博弈论)
马尔可夫决策过程
博弈论
竞争优势
决策论
完全竞争
管理科学
收敛速度
作者
S. X. Li,Sanjay Mehrotra
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2025-11-04
卷期号:74 (1): 301-338
标识
DOI:10.1287/opre.2024.0825
摘要
In competitive markets, companies often lack access to their rivals’ sales, costs, and strategies. Can they still learn to make optimal decisions? In a new study, Li and Mehrotra show that the answer is yes. Their research demonstrates that even without competitor data, firms can adaptively learn to make near-optimal choices using only their own operational information. More strikingly, when all players follow such self-driven learning, the entire market converges to a Nash equilibrium—the stable state predicted by economic theory—without explicit coordination. The study establishes theoretical guarantees for both convergence rates and regret performance and illustrates the framework in inventory management and dynamic pricing settings. These findings provide a foundation for data-driven decision making in competitive and uncertain environments and offer insights into how markets naturally self-organize.
科研通智能强力驱动
Strongly Powered by AbleSci AI