Pages that link to "Item:Q1351468"
From MaRDI portal
The following pages link to The complexity of mean payoff games on graphs (Q1351468):
Displaying 50 items.
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- Energy parity games (Q1758152) (← links)
- A delayed promotion policy for parity games (Q1784960) (← links)
- Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982) (← links)
- The tropical analogue of the Helton-Nie conjecture is true (Q1994125) (← links)
- Quantitative reductions and vertex-ranked infinite games (Q2029603) (← links)
- On satisficing in quantitative games (Q2044188) (← links)
- What's decidable about weighted automata? (Q2064522) (← links)
- The GKK algorithm is the fastest over simple mean-payoff games (Q2097231) (← links)
- Comparison of algorithms for simple stochastic games (Q2105472) (← links)
- Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks (Q2173438) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Abstract tropical linear programming (Q2188843) (← links)
- Unique end of potential line (Q2194856) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Strategy synthesis for multi-dimensional quantitative objectives (Q2249657) (← links)
- Synthesizing robust systems (Q2249662) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- A general approach for optimizing dynamic sensor activation for discrete event systems (Q2280709) (← links)
- Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs (Q2290510) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- A non-iterative algorithm for generalized pig games (Q2319668) (← links)
- The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
- The level set method for the two-sided max-plus eigenproblem (Q2393147) (← links)
- Generic uniqueness of the bias vector of finite zero-sum stochastic games with perfect information (Q2408625) (← links)
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- Average-energy games (Q2413482) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- A superpolynomial lower bound for strategy iteration based on snare memorization (Q2446310) (← links)
- A note on the approximation of mean-payoff games (Q2446598) (← links)
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (Q2450666) (← links)
- The quantitative linear-time-branching-time spectrum (Q2453109) (← links)
- The per-character cost of repairing word languages (Q2453121) (← links)
- Concurrent reachability games (Q2465027) (← links)
- Optimal infinite scheduling for multi-priced timed automata (Q2475633) (← links)
- A constructive algorithm for max-min paths problems on energy networks (Q2518634) (← links)
- Model checking discounted temporal properties (Q2575738) (← links)
- A potential reduction algorithm for two-person zero-sum mean payoff stochastic games (Q2636482) (← links)
- Mean-payoff games with partial observation (Q2636514) (← links)
- Optimal supervisory control with mean payoff objectives and under partial observation (Q2662323) (← links)
- Bidding mechanisms in graph games (Q2662675) (← links)
- Mean-payoff games with \(\omega\)-regular specifications (Q2669180) (← links)
- Reachability games with relaxed energy constraints (Q2672231) (← links)
- Cooperative concurrent games (Q2680769) (← links)
- Mean cost cyclical games (Q2757610) (← links)
