Making the best of limited memory in multi-player discounted sum games

MaRDI QIDQ5013875zbMATH OpenFDO

Authors Anshul Gupta, Sven Schewe, Dominik Wojtczak

Publication date 3 December 2021

Full work available at URL https://arxiv.org/abs/1410.4154, http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2015.2

Mathematics Subject Classification ID

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

Recommendations

• On memoryless quantitative objectives
• Extending finite-memory determinacy to multi-player games
• CONCUR 2005 – Concurrency Theory
• Multiplayer cost games with simple Nash equilibria
• Blackwell optimal strategies in priority mean-payoff games

Cites work

• A course in game theory.
• A Non-cooperative Equilibrium for Supergames
• A Tutorial on Satisfiability Modulo Theories
• Equilibrium points in n -person games
• scientific article; zbMATH DE number 3205836 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• Multi-objective discounted reward verification in graphs and MDPs
• Multiplayer cost games with simple Nash equilibria
• Nash equilibria of \(n\)-player repeated games with semi-standard information
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
• On Stochastic Games with Stationary Optimal Strategies
• Pure subgame-perfect equilibria in free transition games
• Stochastic Games
• The complexity of mean payoff games on graphs
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• The Complexity of Nash Equilibria in Limit-Average Games
• Zero-sum stochastic games with unbounded costs: Discounted and average cost cases

Cited in

(6)

• A game-theoretic approach for the synthesis of complex systems
• Natural strategic ability
• scientific article; zbMATH DE number 3902437 (Why is no real title available?)
• Stackelberg-Pareto synthesis
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• The adversarial Stackelberg value in quantitative games

This page was built for publication: Making the best of limited memory in multi-player discounted sum games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013875)