output
20032024
most citedDemystifying Reachability in Vector Addition Systems

88 citations

Showing cs.GTShow all

11 papers · 1 filter

cs.GT2019★ 2 cited

Nash equilibria in games over graphs equipped with a communication mechanism

Patricia Bouyer, Nathan Thomasset

We study pure Nash equilibria in infinite-duration games on graphs, with partial visibility of actions but communication (based on a graph) among the players. We show that a simple…

cs.GT2018

Observation and Distinction. Representing Information in Infinite Games

Dietmar Berwanger, Laurent Doyen

We compare two approaches for modelling imperfect information in infinite games by using finite-state automata. The first, more standard approach views information as the result of…

cs.GT2017

Proceedings Eighth International Symposium on Games, Automata, Logics and Formal Verification

Patricia Bouyer, Andrea Orlandini, Pierluigi San Pietro

This volume contains the proceedings of the Eighth International Symposium on Games, Automata, Logic and Formal Verification (GandALF 2017). The symposium took place in Roma, Italy…

cs.GT2017★ 13 cited

Perfect Half Space Games

Thomas Colcombet, Marcin Jurdziński, Ranko Lazić +1

We introduce perfect half space games, in which the goal of Player 2 is to make the sums of encountered multi-dimensional weights diverge in a direction which is consistent with a…

cs.GT2015★ 42 cited

Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time

Marcin Jurdziński, Ranko Lazić, Sylvain Schmitz

We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the latter…

cs.GT2013★ 2 cited

Doomsday Equilibria for Omega-Regular Games

Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot +1

Two-player games on graphs provide the theoretical frame- work for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has…