Discounting Infinite Games But How and Why?

被引:2
|
作者
Gimbert, Hugo [1 ]
Zielonka, Wieslaw [1 ]
机构
[1] Univ Denis Diderot Paris 7, LIAFA, Case 7014,2 Pl Jussieu, F-75251 Paris 05, France
关键词
parity games; discounting games;
D O I
10.1016/j.entcs.2004.07.005
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In a recent paper de Alfaro, Henzinger and Majumdar [8] observed that discounting successive payments, the procedure that is employed in the classical stochastic game theory since the seminal paper of Shapley [16], is also pertinent in the context of much more recent theory of stochastic parity games [7,6,5] which were proposed as a tool for verification of probabilistic systems. We show that, surprisingly perhaps, the particular discounting used in [8] is in fact very close to the original ideas of Shapley. This observation allows to realize that the specific discounting of [8] suffers in fact from some needless restrictions. We advocate that dropping the constraints imposed in [8] leads to a more general and elegant theory that includes parity and mean payoff games as particular limit cases.
引用
收藏
页码:3 / 9
页数:7
相关论文
共 50 条
  • [1] A note on payments in the lab for infinite horizon dynamic games with discounting
    Arun Gautham Chandrasekhar
    Juan Pablo Xandri
    Economic Theory, 2023, 75 : 389 - 426
  • [2] A note on payments in the lab for infinite horizon dynamic games with discounting
    Chandrasekhar, Arun Gautham
    Xandri, Juan Pablo
    ECONOMIC THEORY, 2023, 75 (02) : 389 - 426
  • [3] Designing games: Why and how
    Chalmers University of Technology
    Interactions, 2008, 6 (6-12)
  • [4] Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
    Abramsky, Samson
    Winschel, Viktor
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2017, 27 (05) : 751 - 761
  • [5] READING GAMES - WHY, HOW, WHEN
    SCHUBERT, DG
    ELEMENTARY ENGLISH, 1959, 36 (06): : 422 - 423
  • [6] How Much Lookahead is Needed to Win Infinite Games?
    Klein, Felix
    Zimmermann, Martin
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2015, 9135 : 452 - 463
  • [7] How much memory is needed to win infinite games?
    Dziembowski, S
    Jurdzinski, M
    Walukiewicz, I
    12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 99 - 110
  • [8] HOW MUCH LOOKAHEAD IS NEEDED TO WIN INFINITE GAMES?
    Klein, Felix
    Zimmermann, Martin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2016, 12 (03)
  • [9] Teaching video games: Why, when, how
    Dion, J
    Cloutier, R
    JOURNAL OF INTELLECTUAL DISABILITY RESEARCH, 2000, 44 : 266 - 266
  • [10] Computer games and CS education: Why and how
    DeLaet, Marianne
    Slattery, Michael C.
    Kuffner, James
    Sweedyk, Elizabeth
    Proc. Thirty Sixth SIGCSE Tech. Symp. Comput. Sci. Educ. SIGCSE, (256-257):