Related papers: Winning in Sequential Parrondo Games by Players wi…
We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously;…
Given a finite set of positive integers, $A$, and starting with a heap of $n$ chips, Alice and Bob alternate turns and on each turn a player chooses $x\in A$ with $x$ smaller or equal than the current number of chips and subtract $x$ chips…
Human beings like to believe they are in control of their destiny. This ubiquitous trait seems to increase motivation and persistence, and is probably evolutionarily adaptive. But how good really is our ability to control? How successful is…
A combinatorial game is a two-player game without hidden information or chance elements. One of the major approaches to analyzing games in combinatorial game theory is to break down a given game position into a disjunctive sum of multiple…
The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
We study infinite two-player win/lose games $(A,B,W)$ where $A,B$ are finite and $W \subseteq (A \times B)^\omega$. At each round Player 1 and Player 2 concurrently choose one action in $A$ and $B$, respectively. Player 1 wins iff the…
Given a dynamic ordinal game, we deem a strategy sequentially rational if there exist a Bernoulli utility function and a conditional probability system with respect to which the strategy is a maximizer. We establish a complete class theorem…
We study the following game. Three players start with initial capitals of $s_{1},s_{2},s_{3}$ dollars; in each round player $P_{m}$ is selected with probability $\frac{1}{3}$; then \emph{he} selects player $P_{n}$ and they play a game in…
In this paper we solve the three-player-game question. A three-player-game consists of a series of rounds. There are altogether three players. Two players participate in each round, at the end of the round the loser quits and the third…
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),…
In the context of multiplayer games, the parallel repetition problem can be phrased as follows: given a game $G$ with optimal winning probability $1-\alpha$ and its repeated version $G^n$ (in which $n$ games are played together, in…
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of…
Dormancy is a costly adaptive strategy that is widespread among living organisms inhabiting diverse environments. We explore mathematical models of predator-prey systems, in order to assess the impact of prey dormancy on the competition…
Repeated games have provided an explanation how mutual cooperation can be achieved even if defection is more favorable in a one-shot game in prisoner's dilemma situation. Recently found zero-determinant strategies have substantially been…
A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is…
Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally…
The game of Knockout is a classic playground game played with two basketballs. This paper uses a Markov process to analyze each player's probability of winning the game given their starting position in line and shooting percentages,…
Evolutionary game theory assumes that players replicate a highly scored player's strategy through genetic inheritance. However, when learning occurs culturally, it is often difficult to recognize someone's strategy just by observing the…
We consider the problem of distributed convergence to efficient outcomes in coordination games through dynamics based on aspiration learning. Under aspiration learning, a player continues to play an action as long as the rewards received…