scientific article; zbMATH DE number 7438565

zbMath1479.91030arXiv1410.4154MaRDI QIDQ5013875

Anshul Gupta, Sven Schewe, Dominik Wojtczak

Publication date: 3 December 2021

Full work available at URL: https://arxiv.org/abs/1410.4154

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Stochastic games, stochastic differential games (91A15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Natural strategic ability ⋮ A game-theoretic approach for the synthesis of complex systems

Cites Work

• Unnamed Item
• Unnamed Item
• Pure subgame-perfect equilibria in free transition games
• The complexity of mean payoff games on graphs
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
• Nash equilibria of \(n\)-player repeated games with semi-standard information
• Multi-objective Discounted Reward Verification in Graphs and MDPs
• The Complexity of Nash Equilibria in Limit-Average Games
• Multiplayer Cost Games with Simple Nash Equilibria
• On Stochastic Games with Stationary Optimal Strategies
• Zero-sum stochastic games with unbounded costs: Discounted and average cost cases
• A Non-cooperative Equilibrium for Supergames
• Mathematical Foundations of Computer Science 2004
• A Tutorial on Satisfiability Modulo Theories
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Equilibrium points in n -person games
• Stochastic Games

This page was built for publication: