International audienceWe propose a fractional relaxation of two-player combinatorial games. Two players can move or/and add fractions of tokens on the nodes of a graph and a player wins if he is the first one to reach a configuration in some specified set. Both allowed moves and winning configurations are defined thanks to linear inequalities. Our framework applies to many two-players games including the fractional variant of cops and robber games. We give some results and promising perspectives of this new framework. Joint work with F. Giroire, S. Pérennes, R.P. Soares
This text serves as a thorough introduction to the rapidly developing field of positional games. Thi...
We describe combinatorial games on graphs in which two players antagonistically build a representati...
Abstract In this paper, we investigate a two-person zero-sum game with fractional loss function, whi...
International audienceWe propose a fractional relaxation of two-player combinatorial games. Two play...
International audienceIn the Spy Game played on a graph G, a single spy travels the vertices of G at...
International audienceIn the Spy game played on a graph G, a single spy travels the vertices of G at...
Ramsey theory studies the internal homogenity of mathematical structures (graphs, number sets), part...
There are several known methods to find winning strategies for two-player combinatorial games. This ...
Ramsey theory studies the internal homogenity of mathematical structures (graphs, number sets), part...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
AbstractWe introduce a new combinatorial game between two players: Magnus and Derek. Initially, a to...
This text serves as a thorough introduction to the rapidly developing field of positional games. Thi...
We describe combinatorial games on graphs in which two players antagonistically build a representati...
Abstract In this paper, we investigate a two-person zero-sum game with fractional loss function, whi...
International audienceWe propose a fractional relaxation of two-player combinatorial games. Two play...
International audienceIn the Spy Game played on a graph G, a single spy travels the vertices of G at...
International audienceIn the Spy game played on a graph G, a single spy travels the vertices of G at...
Ramsey theory studies the internal homogenity of mathematical structures (graphs, number sets), part...
There are several known methods to find winning strategies for two-player combinatorial games. This ...
Ramsey theory studies the internal homogenity of mathematical structures (graphs, number sets), part...
We consider an extension of Church's synthesis problem to ordinals by adding limit transitions to gr...
AbstractWe introduce a new combinatorial game between two players: Magnus and Derek. Initially, a to...
This text serves as a thorough introduction to the rapidly developing field of positional games. Thi...
We describe combinatorial games on graphs in which two players antagonistically build a representati...
Abstract In this paper, we investigate a two-person zero-sum game with fractional loss function, whi...