Pages that link to "Item:Q3591410"

The following pages link to Half-Positional Determinacy of Infinite Games (Q3591410):

Displaying 32 items.

• Quantitative fair simulation games (Q528184) (← links)
• First-cycle games (Q528186) (← links)
• Exploring the boundary of half-positionality (Q656821) (← links)
• Quantitatively fair scheduling (Q764298) (← links)
• On the positional determinacy of edge-labeled games (Q818128) (← links)
• Almost compatible functions and infinite length games (Q1638044) (← links)
• Energy parity games (Q1758152) (← links)
• The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
• On the determinateness of semi-infinite bimatrix games (Q2366100) (← links)
• Average-energy games (Q2413482) (← links)
• Mean-payoff games with \(\omega\)-regular specifications (Q2669180) (← links)
• Cooperative concurrent games (Q2680769) (← links)
• On Memoryless Quantitative Objectives (Q3088278) (← links)
• Determinateness of certain almost-Borel games (Q3718707) (← links)
• Every Lusin set is undetermined in the point-open game (Q4314808) (← links)
• (Q5005142) (← links)
• (Q5013874) (← links)
• (Q5028465) (← links)
• The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
• (Q5089289) (← links)
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions (Q5090979) (← links)
• Computer Science Logic (Q5292636) (← links)
• STACS 2004 (Q5309683) (← links)
• (Q5742223) (← links)
• (Q6134270) (← links)
• Subgame-perfect Equilibria in Mean-payoff Games (journal version) (Q6178672) (← links)
• Submixing and shift-invariant stochastic games (Q6183353) (← links)
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs (Q6566586) (← links)
• Characterizing positionality in games of Infinite duration over infinite graphs (Q6566588) (← links)
• Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)
• Characterizing positionality in games of infinite duration over infinite graphs (Q6649452) (← links)
• New algorithms for combinations of objectives using separating automata (Q6649527) (← links)