Related papers: Analysis of the gift exchange problem

Pursuit-evasion games, such as the game of Revolutionaries and Spies, are a simplified model for network security. In the game we consider in this paper, a team of $r$ revolutionaries tries to hold an unguarded meeting consisting of $m$…

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…

A simple model for cooperation between "selfish" agents, which play an extended version of the Prisoner's Dilemma(PD) game, in which they use arbitrary payoffs, is presented and studied. A continuous variable, representing the probability…

The game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from…

The game of cops and robber is a pursuit-evasion game played on graphs that has been extensively studied. Traditionally the game is played with one or more cops and only one robber, but in this paper we consider the game played with…

The 2 x 2 games, in particular the Prisoner's Dilemma, have been extensively used in studies into reciprocal cooperation and, to a lesser extent, kin selection. This paper examines the suitability of the 2 x 2 games for modelling the…

Imitation is simple behavior which uses successful actions of others in order to deal with one's own problems. Because success of imitation generally depends on whether profit of an imitating agent coincides with those of other agents or…

An unknown positive number of items arrive at independent uniformly distributed times in the interval [0,1] to a selector, whose task is to pick online the last one. We show that under the assumption of an adversary determining the number…

We consider the coupled dynamics of the adaption of network structure and the evolution of strategies played by individuals occupying the network vertices. We propose a computational model in which each agent plays a $n$-round Prisoner's…

Bidding chess is a chess variant where instead of alternating play, players bid for the opportunity to move. Generalizing a known result on so-called Richman games, we show that for a natural class of games including bidding chess, each…

In this paper we will be introducing a type of game which as far as this author is aware has never been studied before. These are games where there are two players, one who is trying to get one of his pieces, called a King to a predefined…

The Internet has enabled the emergence of collective problem solving, also known as crowdsourcing, as a viable option for solving complex tasks. However, the openness of crowdsourcing presents a challenge because solutions obtained by it…

Generalizing a problem posed by Cover, we propose an adversarial game in which a permutation is incrementally constructed in a setting of partial information. As in the secretary problem, this permutation is exposed in stages via the…

Cooperation is usually represented as a Prisoner's Dilemma game. Although individual self-interest may not favour cooperation, cooperation can evolve if, for example, players interact multiple times adjusting their behaviour accordingly to…

In a game of permutation wordle, a player attempts to guess a secret permutation in the fewest number of guesses possible. Previously, Samuel Kutin and Lawren Smithline (arXiv:2408.00903) introduced this game and proposed a strategy called…

Data sharing issues pervade online social and economic environments. To foster social progress, it is important to develop models of the interaction between data producers and consumers that can promote the rise of cooperation between the…

We define and give results on the game NecklaceNim NN($n$,$k$) which is PathNim PN($n$,$k$) with an additional move allowed on the end vertices. This game arises as a sub-game in the context of solving CircularNim CN($n$,$k$) when $k-2$…

We propose and analyse a 2-parameter family of 2-player games on two heaps of tokens, and present a strategy based on a class of sequences. The strategy looks easy, but is actually hard. A class of exotic numeration systems is then used,…

In a caching game introduced by Alpern et al., a Hider who can dig to a total fixed depth normalized to $1$ buries a fixed number of objects among $n$ discrete locations. A Searcher who can dig to a total depth of $h$ searches the locations…

At some places (see the references) Martin Erickson describes a certain game: "Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy four cells…