activity
20122026
most citedGames Where You Can Play Optimally with Arena-Independent Finite Memory

18 citations · 100 across the 28 of their papers we have counts for

collaborators
Showing 2016Show all

5 papers · 1 filter

cs.LO2016★ 1 cited

Bounding Average-energy Games

Patricia Bouyer, Piotr Hofman, Nicolas Markey +2

We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, de…

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.GT2016

Reconciling Rationality and Stochasticity: Rich Behavioral Models in Two-Player Games

Mickael Randour

Two traditional paradigms are often used to describe the behavior of agents in multi-agent complex systems. In the first one, agents are considered to be fully rational and systems…

cs.LO2016

Reachability in Networks of Register Protocols under Stochastic Schedulers

Patricia Bouyer, Nicolas Markey, Mickael Randour +2

We study the almost-sure reachability problem in a distributed system obtained as the asynchronous composition of N copies (called processes) of the same automaton (called protocol…