1 citations · 1 across the 5 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
Solving Streett and Emerson-Lei Games with Universal Trees
Daniel Hausmann, Marcin Jurdzinski, Nir Piterman
Nearly a decade ago, Calude et al. showed that parity games can be solved in quasi-polynomial time. This result is now understood in terms of universal trees. By reduction to parit…
cs.GT2024
Faster and Smaller Solutions of Obliging Games
Daniel Hausmann, Nir Piterman
Obliging games have been introduced in the context of the game perspective on reactive synthesis in order to enforce a degree of cooperation between the to-be-synthesized system an…
cs.GT2023
Doubly Fair Parity Games
Daniel Hausmann, Nir Piterman, Irmak Sağlam +1
We consider two-player games over finite graphs in which both players are restricted by fairness constraints on their moves. Given a two player game graph and a set of fa…