Positional strategies for mean payoff games
From MaRDI portal
Publication:1172002
DOI10.1007/BF01768705zbMATH Open0499.90098OpenAlexW1971499713MaRDI QIDQ1172002FDOQ1172002
Andrzej Ehrenfeucht, Jan Mycielski
Publication date: 1979
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01768705
Cites Work
Cited In (only showing first 100 items - show all)
- Equilibria for games with combined qualitative and quantitative objectives
- General quantitative specification theories with modal transition systems
- Incentive Stackelberg Mean-Payoff Games
- Constraint Satisfaction Problems over Numeric Domains
- A survey of stochastic \(\omega \)-regular games
- Tropical linear-fractional programming and parametric mean payoff games
- Probabilistic Weighted Automata
- Nash-solvable two-person symmetric cycle game forms
- Cyclic games and linear programming
- Mean-payoff games and propositional proofs
- Optimal strategy synthesis for request-response games
- The Complexity of Nash Equilibria in Limit-Average Games
- On Values of Games
- The complexity of mean payoff games
- Time-Optimal Winning Strategies for Poset Games
- Abstract tropical linear programming
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Quantitative simulations by matrices
- Strategy synthesis for multi-dimensional quantitative objectives
- Looking at mean-payoff and total-payoff through windows
- The complexity of multi-mean-payoff and multi-energy games
- Hard problems in max-algebra, control theory, hypergraphs and other areas
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions
- Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information
- Title not available (Why is that?)
- Equilibria, fixed points, and complexity classes
- Discrete control and algorithms for solving antagonistic dynamic games on networks
- On the spectrum in max algebra
- Recursive Markov decision processes and recursive stochastic games
- Title not available (Why is that?)
- Mean-payoff games with partial observation
- On short paths interdiction problems: Total and node-wise limited interdiction
- Graph Games and Reactive Synthesis
- Cyclical games with prohibitions
- Faster algorithms for mean-payoff games
- Cycles in extensive form perfect information games
- From Parity and Payoff Games to Linear Programming
- Energy Games in Multiweighted Automata
- Tropical polyhedra are equivalent to mean payoff games
- Polynomial-time algorithms for energy games with special weight structures
- Mean-payoff games with \(\omega\)-regular specifications
- Determining the optimal strategies for zero-sum average stochastic positional games
- The Cost of Traveling between Languages
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- A note on the approximation of mean-payoff games
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- On canonical forms for zero-sum stochastic mean payoff games
- On the positional determinacy of edge-labeled games
- The Complexity of Infinitely Repeated Alternating Move Games
- Qualitative analysis of concurrent mean-payoff games
- New algorithms for solving tropical linear systems
- The complexity of mean payoff games on graphs
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
- Reactive synthesis without regret
- 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
- First-cycle games
- Memoryless determinacy of parity and mean payoff games: a simple proof
- Combinatorial structure and randomized subexponential algorithms for infinite games
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Nash equilibria in symmetric graph games with partial observation
- Quantitative fair simulation games
- Selfish cops and passive robber: qualitative games
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness
- Title not available (Why is that?)
- Enforcing opacity by insertion functions under multiple energy constraints
- Nash Equilibria Conditions for Cyclic Games with p Players
- Continuous Positional Payoffs
- DYNAMICS OF CHOICE RESTRICTION IN LARGE GAMES
- Title not available (Why is that?)
- On the Existence of Stationary Nash Equilibria for Mean Payoff Games on Graphs
- On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
- Using strategy improvement to stay alive
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Theory of Universal Graphs for Infinite Duration Games
- Title not available (Why is that?)
- Solving parity games via priority promotion
- On Memoryless Quantitative Objectives
- The per-character cost of repairing word languages
- Title not available (Why is that?)
- Average-energy games
- Looking at mean payoff through foggy windows
- Dynamic Restriction of Choices: Synthesis of Societal Rules
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions
- Half-positional objectives recognized by deterministic Büchi automata
- Hyperplane separation technique for multidimensional mean-payoff games
- On Nash Equilibria in Stochastic Positional Games with Average Payoffs
- Compositional strategy synthesis for stochastic games with multiple objectives
- Quantitative reductions and vertex-ranked infinite games
- Parity Games and Propositional Proofs
- An average polynomial algorithm for solving antagonistic games on graphs
- Protocol scheduling
- On the complexity of computational problems associated with simple stochastic games
- Bounding Average-Energy Games
- Tropical pseudolinear and pseudoquadratic optimization as parametric mean-payoff games
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
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)