Add to ORKGAbstract. This chapter is based on a lecture of Jean-François Mertens. Two main topics are dealt with: (i) The reduction of a general (stochastic) game model to various combinatorial descriptions; (ii) the use of consistent probability distributions on the Universal Belief Space in order to exploit a recursive structure of zero-sum games. These constructions lead to a conjecture that would guarantee the ex-istence of the maxmin and its characterization whenever the information received by the maximizer is finer than that received by the minimizer
We consider a game G(n) played by two players. There are n independent random variables Z(1), ..., Z...
AbstractIn Formal Methods we use mathematical structures to model real systems we want to build, or ...
The paper proposes a natural measure space of zero-sum perfect information games with upper semicont...
In deterministic zero-sum two-person games, the upper and lower values move towards each other as th...
The finite state space stochastic game model by Shapley [31] covered in [33] was generalized among o...
Cahier de Recherche du Groupe HEC Paris, n° 743This chapter presents developments in the theory of s...
We prove that in a two-player zero-sum repeated game where one of the players, say player 1, is more...
In many real-world problems, there is a dynamic interaction between competitive agents. Partially ob...
We study subgame φ-maxmin strategies in two-player zero-sum stochastic games with finite action spac...
AbstractThis paper is concerned with a maximum principle for both zero-sum and nonzero-sum games. Th...
We examine the guarantee levels of the players in a type of zero sum games. We show how these levels...
Recursive games are stochastic games with the property that any nonzero-payoff is absorbing, i.e., p...
In Formal Methods we use mathematical structures to model real systems we want to build, or to reaso...
We prove the existence of the maxmin of zero-sum recursive games with one sided information.ou
The purpose of the thesis is the examination of the Minimax Theorem of the Theory of Games. Consider...
We consider a game G(n) played by two players. There are n independent random variables Z(1), ..., Z...
AbstractIn Formal Methods we use mathematical structures to model real systems we want to build, or ...
The paper proposes a natural measure space of zero-sum perfect information games with upper semicont...
In deterministic zero-sum two-person games, the upper and lower values move towards each other as th...
The finite state space stochastic game model by Shapley [31] covered in [33] was generalized among o...
Cahier de Recherche du Groupe HEC Paris, n° 743This chapter presents developments in the theory of s...
We prove that in a two-player zero-sum repeated game where one of the players, say player 1, is more...
In many real-world problems, there is a dynamic interaction between competitive agents. Partially ob...
We study subgame φ-maxmin strategies in two-player zero-sum stochastic games with finite action spac...
AbstractThis paper is concerned with a maximum principle for both zero-sum and nonzero-sum games. Th...
We examine the guarantee levels of the players in a type of zero sum games. We show how these levels...
Recursive games are stochastic games with the property that any nonzero-payoff is absorbing, i.e., p...
In Formal Methods we use mathematical structures to model real systems we want to build, or to reaso...
We prove the existence of the maxmin of zero-sum recursive games with one sided information.ou
The purpose of the thesis is the examination of the Minimax Theorem of the Theory of Games. Consider...
We consider a game G(n) played by two players. There are n independent random variables Z(1), ..., Z...
AbstractIn Formal Methods we use mathematical structures to model real systems we want to build, or ...
The paper proposes a natural measure space of zero-sum perfect information games with upper semicont...