Computer Science Logic

DOI10.1007/b100120zbMath1095.91001MaRDI QIDQ5311283

Marcin Jurdziński, Rupak Majumdar, Krishnendu Chatterjee

Publication date: 22 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100120

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91A43: Games involving graphs

91A06: (n)-person games, (n>2)

91A15: Stochastic games, stochastic differential games

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Infinite-Duration Bidding Games, The Complexity of Nash Equilibria in Infinite Multiplayer Games, Unnamed Item, Unnamed Item, Synthesis with rational environments, Network-formation games with regular objectives, A survey of stochastic \(\omega \)-regular games, Nash equilibria in symmetric graph games with partial observation, Selfish cops and passive robber: qualitative games, Randomness for free, An abstraction-refinement methodology for reasoning about network games, On equilibria in quantitative games with reachability/safety objectives, A note on the Nash equilibria of some multi-player reachability/safety games, A game-theoretic approach for the synthesis of complex systems, Timed network games, Automatic verification of concurrent stochastic systems, Infinite-duration poorman-bidding games, Optimal strategies for selecting coordinators, The complexity of solving reachability games using value and strategy iteration, Dynamic resource allocation games, Generalized cops and robbers: a multi-player pursuit game on graphs, Selfish cops and active robber: multi-player pursuit evasion on graphs, Bounding fixed points of set-based Bellman operator and Nash equilibria of stochastic games, On Pure Nash Equilibria in Stochastic Games, A Note on Game Theory and Verification, Hierarchical Network Formation Games, Decision Problems for Nash Equilibria in Stochastic Games