Related papers: Pizza Race Problem
We study the proportional chore division problem where a protocol wants to divide an undesirable object, called chore, among $n$ different players. The goal is to find an allocation such that the cost of the chore assigned to each player be…
There are many papers written on the Two Envelopes Problem that usually study some of its variations. In this paper we will study and compare the most significant variations of the problem. We will see the correct decisions for each player…
We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players choose, simultaneously and independently, an action. Then a successor…
This paper is concerned with continuous-time pursuit and evasion games. Typically, we have a lion and a man in a metric space: they have the same speed, and the lion wishes to catch the man while the man tries to evade capture. We are…
The paper considers fair allocation of resources that are already allocated in an unfair way. This setting requires a careful balance between the fairness considerations and the rights of the present owners. The paper presents re-division…
In a classical chess round-robin tournament, each of $n$ players wins, draws, or loses a game against each of the other $n-1$ players. A win rewards a player with 1 points, a draw with 1/2 point, and a loss with 0 points. We are interested…
We consider the following combinatorial game: two players, Fast and Slow, claim $k$-element subsets of $[n]=\{1,2,...,n\}$ alternately, one at each turn, such that both players are allowed to pick sets that intersect all previously claimed…
Two people meet in a coffeehouse and decide to share one dessert from a menu of several possible choices. How should they choose which one? A method is presented that is intended to be practical, avoiding the need for long negotiations or…
A group of players which contain n sellers and n buyers bargain over the partitions of n pies. A seller(/buyer) has to reach an agreement with a buyer (/seller) on the division of a pie. The players bargain in a system like the stock…
We introduce a natural variant of the parallel chip-firing game, called the diffusion game. Chips are initially assigned to vertices of a graph. At every step, all vertices simultaneously send one chip to each neighbour with fewer chips. As…
This article deals with the cake cutting problem. In this setting, there exists two notions of fair division: proportional division (when there are n players, each player thinks to get at least 1/n of the cake) and envy-free division (each…
This paper introduces a strategy in the two envelopes problem that utilizes the prior beliefs of two players about the amount of money that their envelopes can contain. This strategy gives them more information about the decision of…
Candy Nim is a variant of Nim in which both players aim to take the last candy in a game of Nim, with the added simultaneous secondary goal of taking as many candies as possible. We give bounds on the number of candies the first and second…
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…
In the best choice problem with random arrivals, an unknown number $n$ of rankable items arrive at times sampled from the uniform distribution. As is well known, a real-time player can ensure stopping at the overall best item with…
In this study, we investigate three-dimensional chocolate bar games, which are variants of the game of Chomp. A three-dimensional chocolate bar is a three-dimensional array of cubes in which a bitter cubic box is present in some part of the…
We consider the problem of fairly dividing a two dimensional heterogeneous good among multiple players. Applications include division of land as well as ad space in print and electronic media. Classical cake cutting protocols primarily…
In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to…
Suppose an escaping player ("human") moves continuously at maximum speed $1$ in the interior of a region, while a pursuing player ("zombie") moves continuously at maximum speed $r$ outside the region. For what $r$ can the first player…
The \emph{stationary set splitting game} is a game of perfect information of length $\omega_{1}$ between two players, \unspls and \spl, in which \unspls chooses stationarily many countable ordinals and \spls tries to continuously divide…