Automation & Computer Technologies

Boundedly Rational Agents in Sequential Posted Pricing

Expand
  • 1. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China; 2. Center on Frontiers of Computing Studies, Peking University, Beijing 100871, China

Received date: 2023-03-10

  Accepted date: 2023-05-08

  Online published: 2023-12-12

Abstract

We consider the well-studied sequential posted pricing scenarios. In these scenarios, an auctioneer typically learns the value distributions of all agents as prior information and then offers a take-it-or-leave-it price to each sequentially coming agent. If the value distributions are correctly learned, the dominant strategy of each agent is telling the truth. However, an agent could manipulate her value distribution to exploit the auctioneer. We study the behavior of sophisticated agents predicted by two prominent bounded rationality models: the level-k and the cognitive hierarchy models. We begin with analyzing the structure of the optimal reported distributions and then provide algorithms to compute the optimal distributions for each model. In the continuous scenarios, we show that both models are ill-defined by some examples. Moreover, we evaluate both models in discrete scenarios with different numbers of agents, different minimum units of the values, and different risk tolerances. The empirical results and a brief discussion about the Bayesian Nash equilibrium of the experimental scenarios show that both the level-k model and the equilibrium suggest the highest possible prices. In contrast, the cognitive hierarchy model suggests low prices. The level-k model and the equilibrium somehow explain the “winner’s curse” in online markets. The models and the equilibrium fail to explain that the same item could have different prices in different shops. To explain the different-price phenomenon, we suggest trying other bounded rationality models for agents and/or considering the auctioneers with bounded rationality.

Cite this article

Huang Wenhan, Deng Xiaotie . Boundedly Rational Agents in Sequential Posted Pricing[J]. Journal of Shanghai Jiaotong University(Science), 2026 , 31(2) : 390 -404 . DOI: 10.1007/s12204-023-2681-0

References

[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.


Outlines

/