A note on the approximation of mean-payoff games
From MaRDI portal
Publication:2446598
DOI10.1016/j.ipl.2014.02.010zbMath1284.68667OpenAlexW2065358412MaRDI QIDQ2446598
Publication date: 17 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.010
Related Items (2)
Looking at mean payoff through foggy windows ⋮ Approximation schemes for stochastic mean payoff games with perfect information and few random positions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- On canonical forms for zero-sum stochastic mean payoff games
- Polynomial-time algorithms for energy games with special weight structures
- Faster algorithms for mean-payoff games
- Cyclical games with prohibitions
- Results on the propositional \(\mu\)-calculus
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- Optimal search for rationals
- Positional strategies for mean payoff games
- Extensions of two person zero sum games
- The complexity of mean payoff games on graphs
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- Mean Cost Cyclical Games
- Automated analysis of real-time scheduling using graph games
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
- The Cost of Traveling between Languages
- From Parity and Payoff Games to Linear Programming
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Quantitative Languages
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Better Quality in Synthesis through Quantitative Objectives
- Quantitative Languages Defined by Functional Automata
This page was built for publication: A note on the approximation of mean-payoff games
