Positional Games is a branch of Combinatorics which focuses on a variety of two player games, ranging from well-known games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs. The field has experienced quite a growth in recent years, with more than a few applications in related areas. We aim to introduce the basic notions, approaches and tools, as well as to survey the recent developments, open problems and promising research directions, keeping the main focus on the games played on graphs
Half positionality is the property of a language of infinite words to admit positional winning strat...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging f...
This text serves as a thorough introduction to the rapidly developing field of positional games. Thi...
We study games where two players are coloring edges of infinite complete graph. Both players are try...
We describe combinatorial games on graphs in which two players antagonistically build a representati...
We describe combinatorial games on graphs in which two players antagonistically build a representati...
Winning Strategies of graph-interpretable games can be obtained by using \u22Kernels\u22 of underlyi...
AbstractEvery vertex of an abstract-directed graph is characterized in terms of a two-person game. A...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
A general position set of a graph G is a set of vertices S in G such that no three vertices from S l...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Positional games are a branch of combinatorics, researching a variety of two-player games, ranging f...
This text serves as a thorough introduction to the rapidly developing field of positional games. Thi...
We study games where two players are coloring edges of infinite complete graph. Both players are try...
We describe combinatorial games on graphs in which two players antagonistically build a representati...
We describe combinatorial games on graphs in which two players antagonistically build a representati...
Winning Strategies of graph-interpretable games can be obtained by using \u22Kernels\u22 of underlyi...
AbstractEvery vertex of an abstract-directed graph is characterized in terms of a two-person game. A...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investig...
A general position set of a graph G is a set of vertices S in G such that no three vertices from S l...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Half positionality is the property of a language of infinite words to admit positional winning strat...
Half positionality is the property of a language of infinite words to admit positional winning strat...