Games with imperfectly observable commitment

被引:58
|
作者
vanDamme, E [1 ]
Hurkens, S [1 ]
机构
[1] UNIV POMPEU FABRA,DEPT ECON,BARCELONA 08008,SPAIN
关键词
D O I
10.1006/game.1997.0524
中图分类号
F [经济];
学科分类号
02 ;
摘要
K. Bagwell (1995, Games Econ. Behav. 8, 271-280) claims that, in models of commitment, ''the first-mover advantage is eliminated when there is a slight amount of noise associated with the observation of the first-mover's selection.'' We show that the validity of this claim depends crucially on the restriction to pure strategy equilibria. The game analyzed by Bagwell always has a mixed equilibrium that is close to the Stackelberg equilibrium when the noise is small. Furthermore, an equilibrium selection theory that combines elements from the theory of Harsanyi and Selten (1988, A General Theory of Equilibrium Selection in Games. Cambridge, MA: MIT Press) with elements from the theory of Harsanyi (1995, Games Econ. Behav. 8, 91-122), actually selects this ''noisy Stackelberg equilibrium.'' (C) 1997 Academic Press.
引用
收藏
页码:282 / 308
页数:27
相关论文
共 50 条
  • [41] Commitment Games with Conditional Information Disclosure
    DiGiovanni, Anthony
    Clifton, Jesse
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 5, 2023, : 5616 - 5623
  • [42] Partially observable semi-Markov games with discounted payoff
    Ghosh, Mrinal K.
    Goswami, Anindya
    STOCHASTIC ANALYSIS AND APPLICATIONS, 2006, 24 (05) : 1035 - 1059
  • [43] Improving Policies via Search in Cooperative Partially Observable Games
    Lerer, Adam
    Hu, Hengyuan
    Foerster, Jakob
    Brown, Noam
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 7187 - 7194
  • [44] Solving Partially Observable Stochastic Shortest-Path Games
    Tomasek, Petr
    Horak, Karel
    Aradhye, Aditya
    Bosansky, Branislav
    Chatterjee, Krishnendu
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 4182 - 4189
  • [45] Surprising strategies obtained by stochastic optimization in partially observable games
    Cauwet, Marie-Liesse
    Teytaud, Olivier
    2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 31 - 38
  • [46] PALO bounds for reinforcement learning in partially observable stochastic games
    Ceren, Roi
    He, Keyang
    Doshi, Prashant
    Banerjee, Bikramjit
    NEUROCOMPUTING, 2021, 420 : 36 - 56
  • [47] Efficient on-the-fly algorithms for partially observable timed games
    Cassez, Franck
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2007, 4763 : 5 - 24
  • [48] Compact Representation of Value Function in Partially Observable Stochastic Games
    Horak, Karel
    Bosansky, Branislav
    Kiekintveld, Christopher
    Kamhoua, Charles
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 350 - 356
  • [49] Planning for Weakly-Coupled Partially Observable Stochastic Games
    Guo, AnYuan
    Lesser, Victor
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 1715 - 1716
  • [50] Unsupervised State Representation Learning in Partially Observable Atari Games
    Meng, Li
    Goodwin, Morten
    Yazidi, Anis
    Engelstad, Paal
    COMPUTER ANALYSIS OF IMAGES AND PATTERNS, CAIP 2023, PT II, 2023, 14185 : 212 - 222