English
Related papers

Related papers: Resolving the two envelope paradox

200 papers

Toral (2002) considered an ensemble of N\geq2 players. In game B a player is randomly selected to play Parrondo's original capital-dependent game. In game A' two players are randomly selected without replacement, and the first transfers one…

Probability · Mathematics 2012-03-19 S. N. Ethier , Jiyeon Lee

A gambler walks into a hypothetical fair casino with a very real dollar bill, but by the time he leaves he's exchanged the dollar for a random amount of money. What is lost in the process? It may be that the gambler walks out at the end of…

Probability · Mathematics 2015-03-20 Paul Cuff , Thomas Cover , Gowtham Kumar , Lei Zhao

Two players alternate tossing a biased coin where the probability of getting heads is p. The current player is awarded alpha points for tails and alpha+beta for heads. The first player reaching n points wins. For a completely unfair coin…

Probability · Mathematics 2011-12-15 Robert W. Chen , Burton Rosenberg

We study an evolutionary game of chance in which the probabilities for different outcomes (e.g., heads or tails) depend on the amount wagered on those outcomes. The game is perhaps the simplest possible probabilistic game in which…

Physics and Society · Physics 2007-08-29 Dmitriy Cherkashin , J. Doyne Farmer , Seth Lloyd

In this paper, we study a game with positive or plus infinite expectation and determine the optimal proportion of investment for maximizing the limit expectation of growth rate per attempt. With this objective, we introduce a new pricing…

Optimization and Control · Mathematics 2013-06-28 Yukio Hirashita

Parrondo's paradox occurs in sequences of games in which a winning expectation value of a payoff may be obtained by playing two games in a random order, even though each game in the sequence may be lost when played individually.Several…

Physics and Society · Physics 2012-11-11 Norihito Toyota

The rational solution of the Monty Hall problem unsettles many people. Most people, including the authors, think it feels wrong to switch the initial choice of one of the three doors, despite having fully accepted the mathematical proof for…

Other Statistics · Statistics 2019-03-27 Torsten Enßlin , Margret Westerkamp

We consider a card guessing game with complete feedback. An ordered deck of $n$ cards labeled $1$ up to $n$ is shelf-shuffled exactly one time. One after the other a single card is drawn from the shuffled deck. The guesser makes has guess…

Combinatorics · Mathematics 2026-02-24 Markus Kuba

A fair coin is flipped $n$ times, and two finite sequences of heads and tails (words) $A$ and $B$ of the same length are given. Each time the word $A$ appears in the sequence of coin flips, Alice gets a point, and each time the word $B$…

Combinatorics · Mathematics 2025-01-06 Anne-Laure Basdevant , Olivier Hénard , Edouard Maurel-Segala , Arvind Singh

In the game of Matching Pennies, Alice and Bob each hold a penny, and at every tick of the clock they simultaneously display the head or the tail sides of their coins. If they both display the same side, then Alice wins Bob's penny; if they…

Computer Science and Game Theory · Computer Science 2018-02-05 Dusko Pavlovic , Peter-Michael Seidel , Muzamil Yahia

We explore whether ambiguous communication can be beneficial to the sender in a persuasion problem, when the receiver (and possibly the sender) is ambiguity averse. Our analysis highlights the necessity of using a collection of experiments…

Theoretical Economics · Economics 2026-02-19 Xiaoyu Cheng , Peter Klibanoff , Sujoy Mukerji , Ludovic Renou

This paper looks into the gain or loss from rolling a fair die multiple times and choosing the highest or lowest number as the outcome over rolling the die just once. Specifically, this paper gives a general formula for the expected value…

General Mathematics · Mathematics 2023-09-18 Fan Jiang , Elvin Jiang

Consider the following method of card shuffling. Start with a deck of $N$ cards numbered 1 through N. Fix a parameter $p$ between 0 and 1. In this model a ``shuffle'' consists of uniformly selecting a pair of adjacent cards and then…

Probability · Mathematics 2007-05-23 Itai Benjamini , Noam Berger , Christopher Hoffman , Elchanan Mossel

We present an analysis of a coin-tossing problem posed by Daniel Litt which has generated some popular interest. We demonstrate a recursive identity which leads to relatively simple formulas for the excess number of wins for one player over…

Combinatorics · Mathematics 2025-12-09 Bruce Levin

Parrondo's paradox occurs in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. Several variations of…

Physics and Society · Physics 2012-06-14 Norihito Toyota

This paper provides sufficient conditions for the existence of solutions for two-person zero-sum games with inf/sup-compact payoff functions and with possibly noncompact decision sets for both players. Payoff functions may be unbounded, and…

Optimization and Control · Mathematics 2021-12-22 Eugene A. Feinberg , Pavlo O. Kasyanov , Michael Z. Zgurovsky

A simple classical probabilistic system (a simple card game) classically exemplifies Aharonov and Vaidman's "Three-Box 'paradox'" [J. Phys. A 24, 2315 (1991)], implying that the Three-Box example is neither quantal nor a paradox and leaving…

Quantum Physics · Physics 2009-11-07 K. A. Kirkpatrick

This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical information regarding the rewards of each resource.…

Computer Science and Game Theory · Computer Science 2023-09-19 Mevan Wijewardena , Michael J. Neely

In a prediction tournament, contestants "forecast" by asserting a numerical probability for each of (say) 100 future real-world events. The scoring system is designed so that (regardless of the unknown true probabilities) more accurate…

Statistics Theory · Mathematics 2019-03-07 David Aldous

We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the…

Probability · Mathematics 2024-09-05 Natalia Cardona-Tobón , Anja Sturm , Jan M. Swart