J Shanghai Jiaotong Univ Sci ›› 2026, Vol. 31 ›› Issue (2): 390-404.doi: 10.1007/s12204-023-2681-0
收稿日期:2023-03-10
接受日期:2023-05-08
出版日期:2026-04-01
发布日期:2023-12-12
黄文瀚1,邓小铁2
Received:2023-03-10
Accepted:2023-05-08
Online:2026-04-01
Published:2023-12-12
摘要: 关注于被广泛研究的连续报价拍卖场景。在这些场景中,拍卖者通常会先学习所有智能体的价值分布并将其作为先验信息,然后依照这一先验信息向每个顺序到来的智能体报出一个物品价格,智能体只能学则接受这个价格买下物品或放弃交易。如果拍卖者能正确学习到价值分布,每个智能体的占优策略就是说实话。然而,智能体存在操纵她的价值分布来剥削拍卖者的可能。研究了两个著名有限理性模型预测的理性智能体行为:阶层-k模型和认知阶层模型。首先分析了最优谎报分布的结构,然后对每个模型下的智能体给出了计算最优分布的算法。在连续场景中,通过一些例子表明两个模型都是定义不清的。此外,在不同数量代理人、不同最小单位价值和不同风险承受能力的离散场景中评估了两种模型。实验结果和对实验场景中贝叶斯纳什均衡的简要讨论表明,阶层-k模型和均衡都预言智能体谎报分布中概率会集中在其最高可能的价格。与之相反,认知阶层模型预言智能体谎报分布中概率会集中在低价格。阶层-k模型和均衡在某种程度上解释了在线市场中的“赢家诅咒”现象。然而,这些模型和均衡都不能解释同一物品在不同商店中可能有不同价格的现象。为了解释不同价格现象,建议尝试其他有限理性模型来表示智能体和(或)考虑具有有限理性的拍卖者。
中图分类号:
. 连续报价拍卖场景中有限理性智能体的研究[J]. J Shanghai Jiaotong Univ Sci, 2026, 31(2): 390-404.
Huang Wenhan, Deng Xiaotie. Boundedly Rational Agents in Sequential Posted Pricing[J]. J Shanghai Jiaotong Univ Sci, 2026, 31(2): 390-404.
| [1] SANDHOLM T, GILPIN A. Sequences of take-it-or-leave-it offers: Near-optimal auctions without full valuation revelation [C]//Fifth international Joint Conference on Autonomous Agents and Multiagent Systems. Hakodate, Japan: ACM, 2006: 1127-1134. [2] BLUMROSEN L, HOLENSTEIN T. Posted prices vs. negotiations: An asymptotic analysis [C]// 9th ACM Conference on Electronic Commerce. Chicago: ACM, 2008: 49. [3] MORGENSTERN J, ROUGHGARDEN T. On the pseudo-dimension of nearly optimal auctions[M]//Advances in neural information processing systems 28. Red Hook: Curran Associates, Inc., 2015: 136-144. [4] MORGENSTERN J, ROUGHGARDEN T. Learning simple auctions [C]// 29th Conference on Learning Theory. New York: Columbia University, 2016: 1298-1318. [5] XIAO T, LIU Z, HUANG W. On the complexity of sequential posted pricing[C]//19th International Conference on Autonomous Agents and Multiagent Systems. Auckland: IFAAMAS, 2020: 1521-1529. [6] TANG P Z, ZENG Y L. The price of prior dependence in auctions [C]// 2018 ACM Conference on Economics and Computation. Ithaca: ACM, 2018: 485-502. [7] DENG X T, LIN T, XIAO T. Private data manipulation in optimal sponsored search auction [C]// The Web Conference 2020. Taipei: ACM, 2020: 2676-2682. [8] CHEN Z H, DENG X T, LI J C, et al. Budget-constrained auctions with unassured priors: Strategic equivalence and structural properties [DB/OL]. (2022-05-31). https://arxiv.org/abs/2203.16816 [9] CHEN Y, DENG X, LI Y. Optimal private payoff manipulation against commitment in extensive-form games[DB/OL]. (2022-06-27). https://arxiv.org/abs/2206.13119 [10] NASH J. Non-cooperative games [J]. Annals of Mathematics, 1951, 54(2): 286-295. [11] SIMON H A. A behavioral model of rational choice [J]. The Quarterly Journal of Economics, 1955, 69(1): 99-118. [12] STAHL D O, WILSON P W. Experimental evidence on players' models of other players [J]. Journal of Economic Behavior & Organization, 1994, 25(3): 309-327. [13] NAGEL R. Unraveling in guessing games: An experimental study [J]. The American Economic Review, 1995, 85(5): 1313-1326. [14] CRAWFORD V P, IRIBERRI N. Level-k auctions: Can a nonequilibrium model of strategic thinking explain the winner’s curse and overbidding in private-value auctions? [J]. Econometrica, 2007, 75(6): 1721-1770. [15] CAMERER C F, HO T H, CHONG J K. A cognitive hierarchy model of games [J]. The Quarterly Journal of Economics, 2004, 119(3): 861-898. [16] CRAWFORD V P, COSTA-GOMES M A, IRIBERRI N. Structural models of nonequilibrium strategic thinking: Theory, evidence, and applications [J]. Journal of Economic Literature, 2013, 51(1): 5-62. [17] CHAWLA S, HARTLINE J D, MALEC D L, et al. Multi-parameter mechanism design and sequential posted pricing [C]// 42nd ACM Symposium on Theory of Computing. Cambridge: ACM, 2010: 311-320. [18] ALAEI S, HARTLINE J, NIAZADEH R, et al. Optimal auctions vs. anonymous pricing [J]. Games and Economic Behavior, 2019, 118: 494-510. [19] JIN Y N, LU P Y, QI Q, et al. Tight approximation ratio of anonymous pricing [C]// 51st Annual ACM SIGACT Symposium on Theory of Computing. Phoenix: ACM, 2019: 674-685. [20] BROCAS I, CARRILLO J D, WANG S W, et al. Imperfect choice or imperfect attention? understanding strategic thinking in private information games [J]. Review of Economic Studies, 2014, 81(3): 944-970. [21] CRAWFORD V P, GNEEZY U, ROTTENSTREICH Y. The power of focal points is limited: Even minute payoff asymmetry may yield large coordination failures [J]. American Economic Review, 2008, 98(4): 1443-1458. [22] COSTA-GOMES M A, SHIMOJI M. A comment on “can relaxation of beliefs rationalize the winner’s curse? An experimental study” [J]. Econometrica, 2015, 83(1): 375-383. [23] LEVIN D, ZHANG L Y. Bridging level-K to Nash equilibrium [J]. Review of Economics and Statistics, 2022, 104(6): 1329-1340. [24] COSTA-GOMES M A, CRAWFORD V P, IRIBERRI N. Comparing models of strategic thinking in van huyck, battalio, and beil’s coordination games [J]. Journal of the European Economic Association, 2009, 7(2/3): 365-376. [25] ÖSTLING R, TAO-YI WANG J, CHOU E Y, et al. Testing game theory in the field: Swedish LUPI lottery games [J]. American Economic Journal: Microeconomics, 2011, 3(3): 1-33. [26] CARVALHO D, SANTOS-PINTO L. A cognitive hierarchy model of behavior in the action commitment game [J]. International Journal of Game Theory, 2014, 43(3): 551-577. [27] KORIYAMA Y, OZKES A I. Inclusive cognitive hierarchy [J]. Journal of Economic Behavior & Organization, 2021, 186: 458-480. [28] CHAKRABORTY T, EVEN-DAR E, GUHA S, et al. Approximation schemes for sequential posted pricing in multi-unit auctions[M]//International workshop on Internet and network economics. Berlin, Heidelberg: Springer, 2010: 158-169. [29] RASOOLY I. Going... going... wrong: A test of the level-k (and cognitive hierarchy) models of bidding behaviour[J]. Journal of Political Economy Microeconomics, 2023, 1(2): 400-445. |
| [1] | . EC-BERT: 面向中文普通话语音识别BERT纠错语言模型[J]. J Shanghai Jiaotong Univ Sci, 2026, 31(2): 282-288. |
| [2] | . Wav2vec-AD:用于语音识别的声学单元发现模块集成式自监督对比预训练方法[J]. J Shanghai Jiaotong Univ Sci, 2026, 31(2): 289-297. |
| [3] | . 改进DeepLabv3+的高分辨率遥感图像分割方法[J]. J Shanghai Jiaotong Univ Sci, 2026, 31(2): 348-358. |
| [4] | . DSNet:用于语音情感识别的带有中性校准的解耦孪生网络[J]. J Shanghai Jiaotong Univ Sci, 2026, 31(2): 248-257. |
| [5] | . ListPose:轻量级隐式时空建模的视频姿态估计模型[J]. J Shanghai Jiaotong Univ Sci, 2026, 31(1): 143-153. |
| [6] | . 基于语义动态超图卷积的三维手姿态估计[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(5): 855-865. |
| [7] | . 面向交通流量预测的多尺度动态超图卷积网络[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(5): 880-888. |
| [8] | . 具有视觉伪装性的人脸识别对抗性图案生成方法[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(5): 911-922. |
| [9] | . 基于异步事件流超图网络的运动目标识别方法[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(5): 952-961. |
| [10] | . 基于Transformer对比学习的自动睡眠分期方法[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(4): 720-732. |
| [11] | . 基于深度学习的肺癌病例文本结构化算法[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(4): 778-789. |
| [12] | . 基于CatBoost特征选择和Stacking集成学习的磨玻璃肺结节识别[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(4): 790-799. |
| [13] | . 基于表面肌电信号的BP-LSTM混合模型肘部运动实时预测[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(3): 455-462. |
| [14] | . 基于基尼不纯度结构优化物理引导神经网络的薄膜型声学超材料传声损失预测[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(3): 613-624. |
| [15] | . 基于两阶段卷积神经网络的焊缝缺陷监测[J]. J Shanghai Jiaotong Univ Sci, 2025, 30(2): 291-299. |
| 阅读次数 | ||||||
|
全文 |
|
|||||
|
摘要 |
|
|||||