56 citations · 307 across the 14 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.GT2009★ 13 cited
Average-Time Games on Timed Automata
Marcin Jurdzinski, Ashutosh Trivedi
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taki…
cs.GT2009
Linear Complementarity Algorithms for Infinite Games
John Fearnley, Marcin Jurdziński, Rahul Savani
The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity…
cs.CC2009★ 29 cited
Reachability-time games on timed automata
Marcin Jurdziński, Ashutosh Trivedi
In a reachability-time game, players Min and Max choose moves so that the time to reach a final state in a timed automaton is minimised or maximised, respectively. Asarin and Maler…