Positional strategies for mean payoff games
From MaRDI portal
Publication:1172002
DOI10.1007/BF01768705zbMath0499.90098OpenAlexW1971499713MaRDI QIDQ1172002
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
Related Items (only showing first 100 items - show all)
On the positional determinacy of edge-labeled games ⋮ TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES ⋮ Hyperplane separation technique for multidimensional mean-payoff games ⋮ Equilibria for games with combined qualitative and quantitative objectives ⋮ Memoryless determinacy of parity and mean payoff games: a simple proof ⋮ Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) ⋮ Looking at mean payoff through foggy windows ⋮ Graph Games and Reactive Synthesis ⋮ Protocol scheduling ⋮ A short certificate of the number of universal optimal strategies for stopping simple stochastic games ⋮ Compositional strategy synthesis for stochastic games with multiple objectives ⋮ The complexity of mean payoff games on graphs ⋮ USING STRATEGY IMPROVEMENT TO STAY ALIVE ⋮ Mean-payoff games with partial observation ⋮ From Parity and Payoff Games to Linear Programming ⋮ Probabilistic Weighted Automata ⋮ An average polynomial algorithm for solving antagonistic games on graphs ⋮ Optimal strategy synthesis for request-response games ⋮ A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games ⋮ Incentive Stackelberg Mean-Payoff Games ⋮ On canonical forms for zero-sum stochastic mean payoff games ⋮ Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks ⋮ Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information ⋮ Safraless LTL synthesis considering maximal realizability ⋮ Mean-payoff games with \(\omega\)-regular specifications ⋮ Average-energy games ⋮ Robust worst cases for parity games algorithms ⋮ Reachability games with relaxed energy constraints ⋮ A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions ⋮ A convex programming-based algorithm for mean payoff stochastic games with perfect information ⋮ Abstract tropical linear programming ⋮ General quantitative specification theories with modal transition systems ⋮ Cooperative concurrent games ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Automated competitive analysis of real-time scheduling with graph games ⋮ Tropical linear-fractional programming and parametric mean payoff 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 ⋮ On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ Computing branching distances with quantitative games ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Equilibria, fixed points, and complexity classes ⋮ A note on the approximation of mean-payoff games ⋮ Bounding Average-Energy Games ⋮ Unnamed Item ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness ⋮ On short paths interdiction problems: Total and node-wise limited interdiction ⋮ Infinite Runs in Weighted Timed Automata with Energy Constraints ⋮ The quantitative linear-time-branching-time spectrum ⋮ The per-character cost of repairing word languages ⋮ Cycles in extensive form perfect information games ⋮ Polynomial-time algorithms for energy games with special weight structures ⋮ Cyclic games and linear programming ⋮ Solving parity games via priority promotion ⋮ The Cost of Traveling between Languages ⋮ Determining the optimal strategies for zero-sum average stochastic positional 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 ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games ⋮ Cyclical games with prohibitions ⋮ Approximation schemes for stochastic mean payoff games with perfect information and few random positions ⋮ 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 ⋮ Approximating the minimum cycle mean ⋮ Faster algorithms for mean-payoff games ⋮ Quantitative Simulation Games ⋮ Mean-payoff games and propositional proofs ⋮ Hard problems in max-algebra, control theory, hypergraphs and other areas ⋮ A delayed promotion policy for parity games ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ On Solving Mean Payoff Games Using Pivoting Algorithms ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ Quantitative simulations by matrices ⋮ A constructive algorithm for max-min paths problems on energy networks ⋮ On the spectrum in max algebra ⋮ On Memoryless Quantitative Objectives ⋮ The Complexity of Nash Equilibria in Limit-Average Games ⋮ Time-Optimal Winning Strategies for Poset Games ⋮ Discrete control and algorithms for solving antagonistic dynamic games on networks ⋮ Dynamic Restriction of Choices: Synthesis of Societal Rules ⋮ Energy Games in Multiweighted Automata ⋮ The GKK algorithm is the fastest over simple mean-payoff games ⋮ 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 ⋮ Nash Equilibria Conditions for Cyclic Games with p Players ⋮ Combinatorial structure and randomized subexponential algorithms for infinite games
Cites Work
This page was built for publication: Positional strategies for mean payoff games
