Positional strategies for mean payoff games
From MaRDI portal
Publication:1172002
Cites work
Cited in
(only showing first 100 items - show all)- Cycles in extensive form perfect information games
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games
- The complexity of mean payoff games on graphs
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Looking at mean payoff through foggy windows
- Compositional strategy synthesis for stochastic games with multiple objectives
- An average polynomial algorithm for solving antagonistic games on graphs
- Safraless LTL synthesis considering maximal realizability
- A convex programming-based algorithm for mean payoff stochastic games with perfect information
- Automated competitive analysis of real-time scheduling with graph games
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Solving parity games via priority promotion
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions
- A delayed promotion policy for parity games
- Memoryless determinacy of parity and mean payoff games: a simple proof
- Quantitative reductions and vertex-ranked infinite games
- The GKK algorithm is the fastest over simple mean-payoff games
- Protocol scheduling
- Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks
- Robust worst cases for parity games algorithms
- Abstract tropical linear programming
- Computing branching distances with quantitative games
- Approximating the minimum cycle mean
- The complexity of multi-mean-payoff and multi-energy games
- Qualitative analysis of concurrent mean-payoff games
- Looking at mean-payoff and total-payoff through windows
- Hyperplane separation technique for multidimensional mean-payoff games
- Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information
- Average-energy games
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
- A note on the approximation of mean-payoff games
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
- The quantitative linear-time-branching-time spectrum
- The per-character cost of repairing word languages
- A constructive algorithm for max-min paths problems on energy networks
- Mean-payoff games with partial observation
- Mean-payoff games with \(\omega\)-regular specifications
- Reachability games with relaxed energy constraints
- Cooperative concurrent games
- Recursive Markov decision processes and recursive stochastic games
- Tropical polyhedra are equivalent to mean payoff games
- Using strategy improvement to stay alive
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Bounding Average-Energy Games
- The Cost of Traveling between Languages
- On memoryless quantitative objectives
- The Complexity of Nash Equilibria in Limit-Average Games
- Dynamic Restriction of Choices: Synthesis of Societal Rules
- Energy games in multiweighted automata
- Graph Games and Reactive Synthesis
- From Parity and Payoff Games to Linear Programming
- Probabilistic Weighted Automata
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- Quantitative reductions and vertex-ranked infinite games
- Discrete control and algorithms for solving antagonistic dynamic games on networks
- Nash Equilibria Conditions for Cyclic Games with p Players
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Quantitative simulation games
- Time-Optimal Winning Strategies for Poset Games
- On canonical forms for zero-sum stochastic mean payoff games
- General quantitative specification theories with modal transition systems
- A survey of stochastic -regular games
- Tropical linear-fractional programming and parametric mean payoff games
- Incentive Stackelberg mean-payoff games
- Equilibria, fixed points, and complexity classes
- On solving mean payoff games using pivoting algorithms
- Constraint satisfaction problems over numeric domains
- Average-energy games
- A delayed promotion policy for parity games
- Reachability games with relaxed energy constraints
- Optimal strategies in weighted limit games
- Games where you can play optimally with arena-independent finite memory
- The Theory of Universal Graphs for Infinite Duration Games
- Beyond admissibility: dominance between chains of strategies
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
- scientific article; zbMATH DE number 7559416 (Why is no real title available?)
- scientific article; zbMATH DE number 7559480 (Why is no real title available?)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- A faster deterministic exponential time algorithm for energy games and mean payoff games
- Equilibria in pure strategies for a two-player zero-sum average stochastic positional game
- Determining the optimal strategies for zero-sum average stochastic positional games
- Faster algorithms for mean-payoff parity games
- Solving mean-payoff games via quasi dominions
- Parity Games and Propositional Proofs
- On values of games
- Reactive synthesis without regret
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
- A nested family of k-total effective rewards for positional games
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- On Nash equilibria in stochastic positional games with average payoffs
- Quantitative fair simulation games
- First-cycle games
- Nash equilibria in symmetric graph games with partial observation
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Selfish cops and passive robber: qualitative games
- The complexity of infinitely repeated alternating move games
- New algorithms for solving tropical linear systems
- Faster algorithms for mean-payoff games
- Dynamics of choice restriction in large games
This page was built for publication: Positional strategies for mean payoff games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1172002)