summary:As shown by Telgársky and Scheepers, winning strategies in the Menger game characterize $\sigma$-compactness amongst metrizable spaces. This is improved by showing that winning Markov strategies in the Menger game characterize $\sigma$-compactness amongst regular spaces, and that winning strategies may be improved to winning Markov strategies in second-countable spaces. An investigation of 2-Markov strategies introduces a new topological property between $\sigma$-compact and Menger spaces
In this paper we review known minimax results with applications in game theory and showthat these re...
Strategies in repeated games can be classified as to whether or not they use memory and/or randomiza...
This short paper isolates a non-trivial class of games for which there exists a monotone relation be...
summary:As shown by Telgársky and Scheepers, winning strategies in the Menger game characterize $\si...
Current paper aims to introduce new types of compactness in terms of notion of K-cover in topologica...
We prove that if NONEMPTY has a Markov strategy in the Choquet game on a space X, then the player ha...
The two main results of this work are the following: if a space X is such that player II has a winni...
International Conference on Topology and its Applications -- JUL 07-11, 2018 -- 3 High Sch Nafpaktos...
We consider a game Gn played by two players. There are n independent random variables Z1; : : : ; Zn...
We consider a game G(n) played by two players. There are n independent random variables Z(1), ..., Z...
AbstractIn [3] R. Telgársky (1975) asked: does the first player have a winning strategy in the game ...
We examine the use of stationary and Markov strategies in zero-sum stochastic games with finite stat...
We extend to the setting of stochastic dynamic games a theorem of Kuhn, and use it to prove the exis...
AbstractWe prove general theorems on the existence of stationery strategies (i.e., strategies depend...
AbstractConsider the following game played in a locally compact space X: at the nth move, K chooses ...
In this paper we review known minimax results with applications in game theory and showthat these re...
Strategies in repeated games can be classified as to whether or not they use memory and/or randomiza...
This short paper isolates a non-trivial class of games for which there exists a monotone relation be...
summary:As shown by Telgársky and Scheepers, winning strategies in the Menger game characterize $\si...
Current paper aims to introduce new types of compactness in terms of notion of K-cover in topologica...
We prove that if NONEMPTY has a Markov strategy in the Choquet game on a space X, then the player ha...
The two main results of this work are the following: if a space X is such that player II has a winni...
International Conference on Topology and its Applications -- JUL 07-11, 2018 -- 3 High Sch Nafpaktos...
We consider a game Gn played by two players. There are n independent random variables Z1; : : : ; Zn...
We consider a game G(n) played by two players. There are n independent random variables Z(1), ..., Z...
AbstractIn [3] R. Telgársky (1975) asked: does the first player have a winning strategy in the game ...
We examine the use of stationary and Markov strategies in zero-sum stochastic games with finite stat...
We extend to the setting of stochastic dynamic games a theorem of Kuhn, and use it to prove the exis...
AbstractWe prove general theorems on the existence of stationery strategies (i.e., strategies depend...
AbstractConsider the following game played in a locally compact space X: at the nth move, K chooses ...
In this paper we review known minimax results with applications in game theory and showthat these re...
Strategies in repeated games can be classified as to whether or not they use memory and/or randomiza...
This short paper isolates a non-trivial class of games for which there exists a monotone relation be...