Related papers: Parrondo games with spatial dependence, II
We consider concurrent games played by two-players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study a…
It is known that a player in a noncooperative game can benefit by publicly restricting his possible moves before play begins. We show that, more generally, a player may benefit by publicly committing to pay an external party an amount that…
We address the problem of existence and (non-)uniqueness of solutions $\big(c,u(\cdot),\mu\big)$ to ergodic mean-field games in the whole space $\mathbb{R}^{m}$ with unbounded and merely measurable data, and for non-separable Hamiltonian.…
An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is well-known that the property of recursive randomness is closed under computable permutations. We…
We study the computational complexity of solving stochastic games with mean-payoff objectives. Instead of identifying special classes in which simple strategies are sufficient to play $\epsilon$-optimally, or form $\epsilon$-Nash…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
Players of a free-to-play game are divided into three main groups: non-paying active users, paying active users and inactive users. A State Space time series approach is then used to model the daily conversion rates between the different…
Recent results of Ye and Hansen, Miltersen and Zwick show that policy iteration for one or two player (perfect information) zero-sum stochastic games, restricted to instances with a fixed discount rate, is strongly polynomial. We show that…
We consider the one-round Voronoi game, where player one (``White'', called ``Wilma'') places a set of n points in a rectangular area of aspect ratio r <=1, followed by the second player (``Black'', called ``Barney''), who places the same…
Here, we study a one-dimensional, non-local mean-field game model with congestion. When the kernel in the non-local coupling is a trigonometric polynomial we reduce the problem to a finite dimensional system. Furthermore, we treat the…
Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by J.~M.~R.~Parrondo, that two losing games $A$ and $B$ can produce an winning outcome has been adapted in many physical and biological…
We investigate the price of anarchy (PoA) in non-atomic congestion games when the total demand $T$ gets very large. First results in this direction have recently been obtained by \cite{Colini2016On, Colini2017WINE, Colini2017arxiv} for…
In this paper we study a class of matrix-valued linear-quadratic mean-field-type games for both the risk-neutral, risk-sensitive and robust cases. Non-cooperation, full cooperation and adversarial between teams are treated. We provide a…
The variation of a martingale $p_0^k=p_0,...,p_k$ of probabilities on a finite (or countable) set $X$ is denoted $V(p_0^k)$ and defined by $V(p_0^k)=E(\sum_{t=1}^k|p_t-p_{t-1}|_1)$. It is shown that $V(p_0^k)\leq \sqrt{2kH(p_0)}$, where…
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within $\epsilon$ in time exponential in a polynomial in the size of the game times polynomial in logarithmic in…
We introduce nonlinear attractive effects into a spatial Prisoner's Dilemma game where the players located on a square lattice can either cooperate with their nearest neighbors or defect. In every generation, each player updates its…
We study a spatial Prisoner's dilemma game with two types (A and B) of players located on a square lattice. Players following either cooperator or defector strategies play Prisoner's Dilemma games with their 24 nearest neighbors. The…
We study a sequential coin-flipping game in which a player starts with~$n$ coins, each landing heads independently with probability~$p$. In each round the player flips all remaining coins and must set aside at least one coin showing heads;…
In this paper, we consider a zero-sum undiscounted stochastic game which has finite state space and finitely many pure actions. Also, we assume the transition probability of the undiscounted stochastic game is controlled by one player and…
We formulate the $(n,k)$ Coset Monogamy Game, in which two players must extract complementary information of unequal size ($k$ bits vs. $n-k$ bits) from a random coset state without communicating. The complementary information takes the…