Related papers: Resolving the two envelope paradox
`Twenty questions' is a guessing game played by two players: Bob thinks of an integer between $1$ and $n$, and Alice's goal is to recover it using a minimal number of Yes/No questions. Shannon's entropy has a natural interpretation in this…
In this paper the results of a simulation of a prisoner's dilemma robin-round tournament are presented. In the tournament each participating strategy plays an iterated prisoner's dilemma against each other strategy (round-robin) and as a…
It is known that repeated gambling over the outcomes of independent and identically distributed (i.i.d.) random variables gives rise to alternate operational meaning of entropies in the classical case in terms of the doubling rates. We give…
In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and there is also a penalty for failing to solve the problem. The…
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ourselves to classical communication, this task requires…
Paradox of choice occurs when permitting new strategies to some players yields lower payoffs for all players in the new equilibrium via a sequence of individually rational actions. We consider social network games. In these games the payoff…
Discuss several tricks for solving twenty question problems which in this paper is depicted as a guessing game. Player tries to find a ball in twenty boxes by asking as few questions as possible, and these questions are answered by only…
The 1936 Mills Futurity slot machine had the feature that, if a player loses 10 times in a row, the 10 lost coins are returned. Ethier and Lee (2010) studied a generalized version of this machine, with 10 replaced by deterministic parameter…
The secretary problem or the game of Googol are classic models for online selection problems that have received significant attention in the last five decades. We consider a variant of the problem and explore its connections to data-driven…
We consider a game in which two separate laboratories collaborate to prepare a quantum system and are then asked to guess the outcome of a measurement performed by a third party in a random basis on that system. Intuitively, by the…
The game of best choice (or "secretary problem") is a model for making an irrevocable decision among a fixed number of candidate choices that are presented sequentially in random order, one at a time. Because the classically optimal…
We consider a sender-receiver game in which the receiver's action is binary and the sender's preferences are state-independent. The state is multidimensional. The receiver can select one dimension of the state to check (i.e., observe)…
Consider a persuasion game where both the sender and receiver are ambiguity averse with maxmin expected utility (MEU) preferences and the sender can choose an ambiguous information structure. This paper analyzes the game in an ex-ante…
We construct games of chance from simpler games of chance. We show that it may happen that the simpler games of chance are fair or unfavourable to a player andyet the new combined game is favourable -- this is a counter-intuitive…
We consider the permutation analogue of Penney's game for words. Two players, in order, each choose a permutation of length $k\ge3$; then a sequence of independent random values from a continuous distribution is generated, until the…
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…
Consider n cards that are labeled 1 through n with n an even integer. The cards are put face down and their ordering starts with card labeled 1 on top through card labeled n at the bottom. The cards are top to random shuffled m times and…
We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D of the real line. The aim of the players is to control the parity of the number of transpositions necessary to put the…
In this work, we consider "decision" variants of a monogamy-of-entanglement game by Tomamichel, Fehr, Kaniewski, and Wehner [New Journal of Physics '13]. In its original "search" variant, Alice prepares a (possibly entangled) state on…
The derivation of the quantum retrodictive probability formula involves an error, an ambiguity. The end result is correct because this error appears twice, in such a way as to cancel itself. In addition, however, the usual expression for…