Continuous Positional Payoffs

DOI10.46298/lmcs-19(3:10)2023arXiv2012.09047MaRDI QIDQ6135780

Unnamed Author, Alexander Kozachinskiy

Publication date: 26 August 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

games on graphspositional strategiescontinuous payoffs

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Combinatorial structure and randomized subexponential algorithms for infinite games
• On the positional determinacy of edge-labeled games
• Positional strategies for mean payoff games
• Infinite games played on finite graphs
• The complexity of mean payoff games on graphs
• Automata, logics, and infinite games. A guide to current research
• Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• Exponential Lower Bounds for Policy Iteration
• Pure Stationary Optimal Strategies in Markov Decision Processes
• Invariant Half-Lines of Nonexpansive Piecewise-Linear Transformations
• Deciding Parity Games in Quasi-polynomial Time
• Mathematical Foundations of Computer Science 2004
• Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
• Stochastic Games
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Continuous Positional Payoffs