Information spillover in multiple zero-sum games

被引:0
|
作者
Pahl, Lucas [1 ]
机构
[1] Univ Bonn, Inst Microecon, Hausdorff Ctr Math, Adenauerallee 24-42, D-53113 Bonn, Germany
关键词
Bayesian repeated games; Bayesian persuasion; Information spillover;
D O I
10.1007/s00182-023-00855-2
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper considers an infinitely repeated three-player zero-sum game with two-sided incomplete information, in which an informed player plays two zero-sum games simultaneously at each stage against two uninformed players. This is a generalization of the model in Aumann et al. (Repeated games with incomplete information. MIT Press, New York, 1995) of two-player zero-sum one-sided incomplete information games. Under a correlated prior, the informed player faces the problem of how to optimally disclose information among two uninformed players in order to maximize his long-term average payoffs (i.e., undiscounted payoffs). Our objective is to understand the adverse effects of "information spillover" from one game to the other in the equilibrium payoff set of the informed player. We provide conditions under which the informed player can fully overcome such adverse effects and characterize equilibrium payoffs. In a second result, we show how the effects of information spillover on the equilibrium payoff set of the informed player might be severe. Finally, we compare our findings on the equilibrium-payoff set of the informed player with those of Bayesian Persuasion models with multiple receivers.
引用
下载
收藏
页码:71 / 104
页数:34
相关论文
共 50 条
  • [41] Definable Zero-Sum Stochastic Games
    Bolte, Jerome
    Gaubert, Stephane
    Vigeral, Guillaume
    MATHEMATICS OF OPERATIONS RESEARCH, 2015, 40 (01) : 171 - 191
  • [42] Zero-Sum Stochastic Stackelberg Games
    Goktas, Denizalp
    Zhao, Jiayi
    Greenwald, Amy
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [43] The value of information structures in zero-sum games with lack of information on one side
    Shmaya, Eran
    INTERNATIONAL JOURNAL OF GAME THEORY, 2006, 34 (02) : 155 - 165
  • [44] On the Complexity of Succinct Zero-Sum Games
    Lance Fortnow
    Russell Impagliazzo
    Valentine Kabanets
    Christopher Umans
    computational complexity, 2008, 17 : 353 - 376
  • [45] Convexity in zero-sum differential games
    Goebel, R
    PROCEEDINGS OF THE 41ST IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 2002, : 3964 - 3969
  • [46] The Value of Information Structures in Zero-sum Games with Lack of Information on One Side
    Eran Shmaya
    International Journal of Game Theory, 2006, 34 : 155 - 165
  • [47] Efficient Computation of Discounted Asymmetric Information Zero-Sum Stochastic Games
    Li, Lichun
    Shamma, Jeff S.
    2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2015, : 4531 - 4536
  • [48] Comparison of Information Structures for Zero-Sum Games in Standard Borel Spaces
    Hogeboom-Burr, Ian
    Yuksel, Serdar
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1361 - 1366
  • [49] On Repeated Zero-Sum Games with Incomplete Information and Asymptotically Bounded Values
    Fedor Sandomirskiy
    Dynamic Games and Applications, 2018, 8 : 180 - 198
  • [50] Efficient Strategy Computation in Zero-Sum Asymmetric Information Repeated Games
    Li, Lichun
    Shamma, Jeff S.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2020, 65 (07) : 2785 - 2800