AbstractWe prove general theorems on the existence of stationery strategies (i.e., strategies depending only on the opponent's last move) in certain infinite positional games of perfect information and we derive some consequences for various topological games
International audienceIn this invited paper, we study the concept of admissible strategies for two p...
We analyze a family of games by using formal topology as a tool. In order to win any game in the fam...
International audienceWe consider infinite antagonistic games over finite graphs. We present conditi...
AbstractWe prove general theorems on the existence of stationery strategies (i.e., strategies depend...
We prove that if NONEMPTY has a Markov strategy in the Choquet game on a space X, then the player ha...
We study turn-based quantitative games of infinite duration opposing twoantagonistic players and pla...
If NONEMPTY has a winning strategy against Empty in the Choquet game on a space, the space is said t...
International audienceWe deal in this paper with strategical languages of infinite words, that is th...
At CSL 2002, Jerzy Marcinkowsi and Tomasz Truderung presented the notions of positive games and pers...
This text serves as a thorough introduction to the rapidly developing field of positional games. Thi...
AbstractWe consider n-person positional games with perfect information modeled by finite directed gr...
We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players ...
In this invited paper, we study the concept of admissible strategies for two player win/lose infinit...
We study a family of infinite games with imperfect information introduced by B. Model for two player...
International audienceIn asynchronous games, Melliès proved that innocent strategies are positional:...
International audienceIn this invited paper, we study the concept of admissible strategies for two p...
We analyze a family of games by using formal topology as a tool. In order to win any game in the fam...
International audienceWe consider infinite antagonistic games over finite graphs. We present conditi...
AbstractWe prove general theorems on the existence of stationery strategies (i.e., strategies depend...
We prove that if NONEMPTY has a Markov strategy in the Choquet game on a space X, then the player ha...
We study turn-based quantitative games of infinite duration opposing twoantagonistic players and pla...
If NONEMPTY has a winning strategy against Empty in the Choquet game on a space, the space is said t...
International audienceWe deal in this paper with strategical languages of infinite words, that is th...
At CSL 2002, Jerzy Marcinkowsi and Tomasz Truderung presented the notions of positive games and pers...
This text serves as a thorough introduction to the rapidly developing field of positional games. Thi...
AbstractWe consider n-person positional games with perfect information modeled by finite directed gr...
We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players ...
In this invited paper, we study the concept of admissible strategies for two player win/lose infinit...
We study a family of infinite games with imperfect information introduced by B. Model for two player...
International audienceIn asynchronous games, Melliès proved that innocent strategies are positional:...
International audienceIn this invited paper, we study the concept of admissible strategies for two p...
We analyze a family of games by using formal topology as a tool. In order to win any game in the fam...
International audienceWe consider infinite antagonistic games over finite graphs. We present conditi...
DOI
Add to ORKG