THE COMPLEXITY OF STOCHASTIC GAMES

被引：280
|
作者：
CONDON, A
机构：
[1] Computer Sciences Department, University of Wisconsin-Madison, Madison, WI 53706
来源：
INFORMATION AND COMPUTATION | 1992年 / 96卷 / 02期
关键词：
D O I：
10.1016/0890-5401(92)90048-K
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the complexity of stochastic games-simple games of chance played by two players. We show that the problem of deciding which player has the greatest chance of winning the game is in the class NP {frown} co-NP. © 1992.
引用
收藏
页码：203 / 224
页数：22
相关论文
共 50 条
  • [1] The complexity of stochastic Muller games
    Chatterjee, Krishnendu
    [J]. INFORMATION AND COMPUTATION, 2012, 211 : 29 - 48
  • [2] Communication Complexity of Stochastic Games
    Krishnamurthy, Nagarajan
    Parthasarathy, T.
    Ravindran, G.
    [J]. 2009 INTERNATIONAL CONFERENCE ON GAME THEORY FOR NETWORKS (GAMENETS 2009), 2009, : 411 - 417
  • [3] The complexity of stochastic Rabin and Streett games
    Chatterjee, K
    de Alfaro, L
    Henzinger, TA
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 878 - 890
  • [4] The Complexity of Markov Equilibrium in Stochastic Games
    Daskalakis, Constantinos
    Golowich, Noah
    Zhang, Kaiqing
    [J]. THIRTY SIXTH ANNUAL CONFERENCE ON LEARNING THEORY, VOL 195, 2023, 195
  • [5] The Complexity of Solving Stochastic Games on Graphs
    Andersson, Daniel
    Miltersen, Peter Bro
    [J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 112 - 121
  • [6] THE COMPLEXITY OF NASH EQUILIBRIA IN STOCHASTIC MULTIPLAYER GAMES
    Ummels, Michael
    Wojtczak, Dominik
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (03)
  • [7] The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
    Ummels, Michael
    Wojtczak, Dominik
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS, 2009, 5556 : 297 - +
  • [8] The Complexity Landscape of Partial-Observation Stochastic Games
    Chatterjee, Krishnendu
    [J]. AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2014, 2014, 8837 : XV - XVII
  • [9] STOCHASTIC DIFFERENTIAL GAMES WITH COMPLEXITY-CONSTRAINED STRATEGIES
    LEONDES, CT
    STUART, DM
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1972, AC17 (01) : 121 - &
  • [10] Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games
    Allamigeon, Xavier
    Gaubert, Stéphane
    Katz, Ricardo D.
    Skomra, Mateusz
    [J]. Information and Computation, 2025, 302
12345