相关论文: Absorbing games with irrational values
This work presents a novel policy iteration algorithm to tackle nonzero-sum stochastic impulse games arising naturally in many applications. Despite the obvious impact of solving such problems, there are no suitable numerical methods…
Imaginary potentials such as $V(x)=-iv 1_\Omega(x)$ (with $v>0$ a constant, $\Omega$ a subset of 3-space, and $1_\Omega$ its characteristic function) have been used in quantum mechanics as models of a detector. They represent the effect of…
We consider graph games of infinite duration with winning conditions in parameterized linear temporal logic, where the temporal operators are equipped with variables for time bounds. In model checking such specifications were introduced as…
We conduct a comprehensive analysis of the discrete-time exponential-weights dynamic with a constant step size on all general-sum and symmetric $2 \times 2$ normal-form games, i.e. games with $2$ pure strategies per player, and where the…
The legal positions of a strong placement game, such as Domineering, form a simplicial complex called the legal complex. In this paper, we use the legal complex to study the game values taken on by the class of strong placement games using…
In this paper we provide formulas for the expectation of a conditional game duration in a finite state-space one-dimensional gambler's ruin problem with arbitrary winning $p(n)$ and losing $q(n)$ probabilities (i.e., they depend on the…
In order to prove irrationality of \sqrt{2} by using only decimal expansions (and not fractions), we develop in detail a model of real numbers based on infinite decimals and arithmetic operations with them.
We characterize common assumption of rationality of 2-person games within an incomplete information framework. We use the lexicographic model with incomplete information and show that a belief hierarchy expresses common assumption of…
Escalation is the fact that in a game (for instance an auction), the agents play forever. It is not necessary to consider complex examples to establish its rationality. In particular, the $0,1$-game is an extremely simple infinite game in…
We prove that zero-sum Dynkin games in continuous time with partial and asymmetric information admit a value in randomised stopping times when the stopping payoffs of the players are general \cadlag measurable processes. As a by-product of…
Our aim is to give for some classes non-additive measures some limit theorems. For balanced games we obtain a weak and strong law of large numbers for bounded random variables, a sharper conclusion is obtain with exact games. We provide an…
A valuation for a player in a game in extensive form is an assignment of numeric values to the players moves. The valuation reflects the desirability moves. We assume a myopic player, who chooses a move with the highest valuation.…
Non-transitivity can arise in games with three or more strategies $A,B,C$, when $A$ beats $B$, $B$ beats $C$, and $C$ beats $A$, ($A>B>C>A$). An example is the children's game \textquotedblleft rock, scissors, paper" ($R,S,P$) where…
We consider a mean field game describing the limit of a stochastic differential game of $N$-players whose state dynamics are subject to idiosyncratic and common noise and that can be absorbed when they hit a prescribed region of the state…
Taking the absolute value of consecutive differences of a cyclicly ordered list of integers constitutes a simple dynamical system. For lists of lenght a power of two the process will terminate in all zeros, but examples with arbitarily long…
We examine short combinatorial games for three or more players under a new play convention in which a player who cannot move on their turn is the unique loser. We show that many theorems of impartial and partizan two-player games under…
We provide several positive and negative complexity results for solving games with imperfect recall. Using a one-to-one correspondence between these games on one side and multivariate polynomials on the other side, we show that solving…
We consider the simple random walk on the $N$-dimensional integer lattice from the perspective of evaluating asymptotically the duration of play in the multidimensional gambler\apost s ruin problem. We show that, under suitable rescalings,…
Three notions of random stopping times exist in the literature. We introduce two concepts of equivalence of random stopping times, motivated by optimal stopping problems and stopping games respectively. We prove that these two concepts…
There is a common belief that humans and many animals follow transitive inference (choosing A over C on the basis of knowing that A is better than B and B is better than C). Transitivity seems to be the essence of rational choice. We…