activity
20152019
most citedWindow Parity Games: An Alternative Approach Toward Parity Games with Time Bounds

14 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

cs.GT2019★ 1 cited

Energy mean-payoff games

Véronique Bruyère, Quentin Hautem, Mickael Randour +1

In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2…

cs.GT2017

Parameterized complexity of games with monotonically ordered ω-regular objectives

Véronique Bruyère, Quentin Hautem, Jean-François Raskin

In recent years, two-player zero-sum games with multiple objectives have received a lot of interest as a model for the synthesis of complex reactive systems. In this framework, Pla…

cs.LO2016

Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds (Full Version)

Véronique Bruyère, Quentin Hautem, Mickael Randour

Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting…

cs.LO2016★ 14 cited

Window Parity Games: An Alternative Approach Toward Parity Games with Time Bounds

Véronique Bruyère, Quentin Hautem, Mickael Randour

Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting…

cs.GT2015

On the complexity of heterogeneous multidimensional quantitative games

Véronique Bruyère, Quentin Hautem, Jean-François Raskin

In this paper, we study two-player zero-sum turn-based games played on a finite multidimensional weighted graph. In recent papers all dimensions use the same measure, whereas here…