Pages that link to "Item:Q1884982"

The following pages link to Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982):

Displayed 13 items.

• Solving parity games in big steps (Q340584) ‎ (← links)
• First-cycle games (Q528186) ‎ (← links)
• Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) ‎ (← links)
• A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) ‎ (← links)
• Cyclic games and linear programming (Q944703) ‎ (← links)
• Looking at mean payoff through foggy windows (Q1629743) ‎ (← links)
• Memoryless determinacy of finite parity games: another simple proof (Q1705645) ‎ (← links)
• Energy parity games (Q1758152) ‎ (← links)
• Average-energy games (Q2413482) ‎ (← links)
• Mean-payoff games with partial observation (Q2636514) ‎ (← links)
• Parameterized Algorithms for Parity Games (Q2946404) ‎ (← links)
• (Q5013874) ‎ (← links)
• Deciding Parity Games in Quasi-polynomial Time (Q5073521) ‎ (← links)