arXiv:cs.LG(机器学习,全量分类)· Yuhang Wu, Assaf Zeevi·· 15 小时前AI 评分46
忽略竞争对手定价的“无知学习”与算法合谋定价研究
Oblivious Learning and Collusive Pricing
AI 导读
在需求未知的竞争市场中,忽略竞争对手价格进行需求学习的“无知”卖家需比垄断者更激进地探索价格,以弥补动态竞争信息的缺失。当所有卖家均“无知”且持续探索时,价格收敛至竞争性结果;探索不足时则出现连续伪均衡。混合市场中知情卖家收益严格高于无知卖家,唯一纳什均衡为全知情市场,无知建模并不能稳健地导致合谋。
正文
Abstract:On a platform with many sellers, should a pricing algorithm explicitly model competitors' prices when learning demand? Classical arguments suggest that ignoring competitors induces model misspecification and inefficiency, yet findings from algorithmic collusion suggest that ignoring competitor prices may, surprisingly, facilitate collusive outcomes and improve profits. We study this problem in a competitive market with unknown noisy demand, in which sellers repeatedly set prices, either incorporating competitor prices in learning their demand models (informed), or ignoring them (oblivious). We show that, relative to a monopolist, an oblivious seller in a competitive market must conduct more aggressive price exploration to compensate for the loss of dynamic competitor information. When all sellers are oblivious, prices converge to the competitive outcome under persistent exploration, while a continuum of pseudo-equilibria arises when exploration is "insufficient." In markets with a mix of oblivious and informed sellers, the informed strictly out-earn the oblivious. In game-theoretic terms, the unique Nash equilibrium is the all-informed market, in which prices converge to the competitive outcome efficiently, and oblivious modeling does not robustly lead to collusive patterns.
| Comments: | EC 2026 |
| Subjects: | Computer Science and Game Theory (cs.GT); Machine Learning (cs.LG); Theoretical Economics (econ.TH); Optimization and Control (math.OC) |
| Cite as: | arXiv:2606.05363 [cs.GT] |
| (or arXiv:2606.05363v3 [cs.GT] for this version) | |
| https://doi.org/10.48550/arXiv.2606.05363 arXiv-issued DOI via DataCite |
Submission history
From: Yuhang Wu [view email]
[v1]
Wed, 3 Jun 2026 19:10:55 UTC (1,209 KB)
[v2]
Mon, 8 Jun 2026 00:27:34 UTC (1,211 KB)
[v3]
Thu, 1 Oct 2026 16:28:23 UTC (1,496 KB)
来源:arXiv:cs.LG(机器学习,全量分类) · arxiv.org