English
Related papers

Related papers: A Treatise on Sucker's Bets

200 papers

An $n$-sided die is an $n$-tuple of positive integers. We say that a die $(a_1,\dots,a_n)$ beats a die $(b_1,\dots,b_n)$ if the number of pairs $(i,j)$ such that $a_i>b_j$ is greater than the number of pairs $(i,j)$ such that $a_i<b_j$. We…

Combinatorics · Mathematics 2025-02-13 D. H. J. Polymath

We settle a version of the conjecture about intransitive dice posed by Conrey, Gabbard, Grant, Liu and Morrison in 2016 and Polymath in 2017. We consider generalized dice with $n$ faces and we say that a die $A$ beats $B$ if a random face…

Probability · Mathematics 2024-11-08 Elisabetta Cornacchia , Jan Hązła

We consider $n$-sided dice whose face values lie between $1$ and $n$ and whose faces sum to $n(n+1)/2$. For two dice $A$ and $B$, define $A \succ B$ if it is more likely for $A$ to show a higher face than $B$. Suppose $k$ such dice…

Combinatorics · Mathematics 2016-07-11 Brian Conrey , James Gabbard , Katie Grant , Andrew Liu , Kent Morrison

We identify a new type of paradoxical behavior in dice, where the sum of independent rolls produces a deceptive sequence of dominance relations. We call these ``anti-inductive dice". Consider a game with two players and two non-identical…

Probability · Mathematics 2025-03-21 Summer Eldridge , Ivo David de Oliveira , Yogev Shpilman

We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…

Probability · Mathematics 2020-10-27 Jan Hązła , Elchanan Mossel , Nathan Ross , Guangqu Zheng

The prediction of the final state probabilities of a general cuboid randomly thrown onto a surface is a problem that naturally arises in the minds of men and women familiar with regular cubic dice and the basic concepts of probability.…

Classical Physics · Physics 2014-07-24 G. A. T. Pender , M. Uhrin

Consider a 4-player version of Matching Pennies where a team of three players competes against the Devil. Each player simultaneously says "Heads" or "Tails". The team wins if all four choices match; otherwise the Devil wins. If all team…

Computer Science and Game Theory · Computer Science 2026-05-14 Léonard Brice , Thomas A. Henzinger , K. S. Thejaswini

This recreational mathematics article shows that the game of Snakes and Ladders is intransitive: square 69 has a winning edge over 79, which in turn beats 73, which beats 69. Analysis of the game is a nice illustration of Markov chains,…

History and Overview · Mathematics 2022-01-19 Gregory B. Sorkin

This paper considers the effect of riffle shuffling on decks of cards, allowing for some cards to be indistinguishable from other cards. The dual problem of dealing a game with hands, such as bridge or poker, is also considered. The…

Probability · Mathematics 2010-02-10 Mark Conger , Jason Howald

The problem of the malicious ma\^{i}tre d' is introduced and solved by Peter Winkler in his book Mathematical Puzzles: A Connoisseur's Collection [1]. This problem is about a ma\^{i}tre d' seating diners around a table, trying to maximize…

Combinatorics · Mathematics 2025-08-19 Tejo V. Madhavarapu

Fitch Cheney's 5-card trick was introduced in 1950. In 2013, Mulcahy invented a 4-card trick in which the cards are allowed to be displayed face down. We suggest our own invention: a 3-card trick in which the cards can be face down and also…

Suppose you look at today's stock prices and bet on the value of the first digit. One could guess that a fair bet should correspond to the frequency of $1/9 = 11.11%$ for each digit from 1 to 9. This is by no means the case, and one can…

Statistical Mechanics · Physics 2008-12-02 L. Pietronero , E. Tosatti , V. Tosatti , A. Vespignani

Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and Bob take turns (with Alice playing first) in declaring numbers from the set {1,2, ...2n}. If a player picks a number that was previously played, that player loses and…

Computational Complexity · Computer Science 2023-07-14 Roey Magen , Moni Naor

A casino offers the following game. There are three cups each containing a die. You are being told that the dice in the cups are all the same, but possibly nonstandard. For a bet of \$1, the game master shakes all three cups and lets you…

Probability · Mathematics 2025-09-16 Pierre C Bellec , Tobias Fritz

Dice odds in the board game RISK were first investigated by Tan, fixed by Osbourne, and extended by Blatt. We generalized dice odds further, varying the number of sides and the number of dice used in a single battle. We show that the…

History and Overview · Mathematics 2015-12-15 Sam Hendel , Charles Hoffman , Corey Manack , Amy Wagaman

In the year 1876 the mathematician Charles Dodgson, who wrote fiction under the now more famous name of Lewis Carroll, devised a beautiful voting system that has long fascinated political scientists. However, determining the winner of a…

Data Structures and Algorithms · Computer Science 2007-06-25 Christopher M. Homan , Lane A. Hemaspaandra

To an adult, it's obvious that the day of someone's death is not precisely determined by the day of birth, but it's a very different story for a child. When the third named author was four years old he asked his father, the fifth named…

A decision maker observes the evolving state of the world while constantly trying to predict the next state given the history of past states. The ability to benefit from such predictions depends not only on the ability to recognize patters…

Computer Science and Game Theory · Computer Science 2014-09-17 Gilad Bavly , Ron Peretz

Two possibly unfair $n$-sided dice, both labelled $1, 2, \ldots, n$, are rolled, and the sum is recorded. How should the dice's sides be weighted so that the resulting sum is closest to the uniform distribution on $2, 3, \ldots, 2n$? We…

History and Overview · Mathematics 2023-08-03 Shamil Asgarli , Michael Hartglass , Daniel Ostrov , Byron Walden

Snackjack is a highly simplified version of blackjack that was proposed by Ethier (2010) and given its name by Epstein (2013). The eight-card deck comprises two aces, two deuces, and four treys, with aces having value either 1 or 4, and…

Probability · Mathematics 2019-06-05 Stewart N. Ethier , Jiyeon Lee
‹ Prev 1 2 3 10 Next ›