Displaying similar documents to “BSDEs with two reflecting barriers driven by a Brownian and a Poisson noise and related Dynkin game.”

Nash Equilibria in a class of Markov stopping games

Rolando Cavazos-Cadena, Daniel Hernández-Hernández (2012)

Kybernetika

Similarity:

This work concerns a class of discrete-time, zero-sum games with two players and Markov transitions on a denumerable space. At each decision time player II can stop the system paying a terminal reward to player I and, if the system is no halted, player I selects an action to drive the system and receives a running reward from player II. Measuring the performance of a pair of decision strategies by the total expected discounted reward, under standard continuity-compactness conditions...

Gδ -sets in topological spaces and games

Winfried Just, Marion Scheepers, Juris Steprans, Paul Szeptycki (1997)

Fundamenta Mathematicae

Similarity:

Players ONE and TWO play the following game: In the nth inning ONE chooses a set O n from a prescribed family ℱ of subsets of a space X; TWO responds by choosing an open subset T n of X. The players must obey the rule that O n O n + 1 T n + 1 T n for each n. TWO wins if the intersection of TWO’s sets is equal to the union of ONE’s sets. If ONE has no winning strategy, then each element of ℱ is a G δ -set. To what extent is the converse true? We show that:  (A) For ℱ the collection of countable subsets of X:   1....

Every Lusin set is undetermined in the point-open game

Ireneusz Recław (1994)

Fundamenta Mathematicae

Similarity:

We show that some classes of small sets are topological versions of some combinatorial properties. We also give a characterization of spaces for which White has a winning strategy in the point-open game. We show that every Lusin set is undetermined, which solves a problem of Galvin.

Undetermined sets of point-open games

Janusz Pawlikowski (1994)

Fundamenta Mathematicae

Similarity:

We show that a set of reals is undetermined in Galvin's point-open game iff it is uncountable and has property C", which answers a question of Gruenhage.

The Banach–Mazur game and σ-porosity

Miroslav Zelený (1996)

Fundamenta Mathematicae

Similarity:

It is well known that the sets of the first category in a metric space can be described using the so-called Banach-Mazur game. We will show that if we change the rules of the Banach-Mazur game (by forcing the second player to choose large balls) then we can describe sets which can be covered by countably many closed uniformly porous sets. A characterization of σ-very porous sets and a sufficient condition for σ-porosity are also given in the terminology of games.

Connected covers and Neisendorfer's localization theorem

C. McGibbon, J. Møller (1997)

Fundamenta Mathematicae

Similarity:

Our point of departure is J. Neisendorfer's localization theorem which reveals a subtle connection between some simply connected finite complexes and their connected covers. We show that even though the connected covers do not forget that they came from a finite complex their homotopy-theoretic properties are drastically different from those of finite complexes. For instance, connected covers of finite complexes may have uncountable genus or nontrivial SNT sets, their Lusternik-Schnirelmann...