This article has multiple issues. Please help improve it or discuss these issues on the talk page . (Learn how and when to remove these messages)
|
A set of dice is intransitive (or nontransitive) if it contains X>2 dice, X1, X2, and X3... with the property that X1 rolls higher than X2 more than half the time, and X2 rolls higher than X3 etc... more than half the time, but where it is not true that X1 rolls higher than Xn more than half the time. In other words, a set of dice is intransitive if the binary relation – X rolls a higher number than Y more than half the time – on its elements is not transitive. More simply, X1 normally beats X2, X2 normally beats X3, but X1 does not normally beat Xn.
It is possible to find sets of dice with the even stronger property that, for each die in the set, there is another die that rolls a higher number than it more than half the time. This is different in that instead of only "A does not normally beat C" it is now "C normally beats A". Using such a set of dice, one can invent games which are biased in ways that people unused to intransitive dice might not expect (see Example). [1] [2] [3] [4]
Consider the following set of dice.
The probability that A rolls a higher number than B, the probability that B rolls higher than C, and the probability that C rolls higher than A are all 5/9, so this set of dice is intransitive. In fact, it has the even stronger property that, for each die in the set, there is another die that rolls a higher number than it more than half the time.
Now, consider the following game, which is played with a set of dice.
If this game is played with a transitive set of dice, it is either fair or biased in favor of the first player, because the first player can always find a die that will not be beaten by any other dice more than half the time. If it is played with the set of dice described above, however, the game is biased in favor of the second player, because the second player can always find a die that will beat the first player's die with probability 5/9. The following tables show all possible outcomes for all three pairs of dice.
Player 1 chooses die A Player 2 chooses die C | Player 1 chooses die B Player 2 chooses die A | Player 1 chooses die C Player 2 chooses die B | |||||||||||
A C | 2 | 4 | 9 | B A | 1 | 6 | 8 | C B | 3 | 5 | 7 | ||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3 | C | A | A | 2 | A | B | B | 1 | C | C | C | ||
5 | C | C | A | 4 | A | B | B | 6 | B | B | C | ||
7 | C | C | A | 9 | A | A | A | 8 | B | B | B |
If one allows weighted dice, i.e., with unequal probability weights for each side, then alternative sets of three dice can achieve even larger probabilities than that each die beats the next one in the cycle. The largest possible probability is one over the golden ratio, . [5]
Efron's dice are a set of four intransitive dice invented by Bradley Efron. [6]
The four dice A, B, C, D have the following numbers on their six faces:
Each die is beaten by the previous die in the list with wraparound, with probability 2/3. C beats A with probability 5/9, and B and D have equal chances of beating the other. [6] If each player has one set of Efron's dice, there is a continuum of optimal strategies for one player, in which they choose their die with the following probabilities, where 0 ≤ x ≤ 3/7: [6]
Miwin's Dice were invented in 1975 by the physicist Michael Winkelmann.
Consider a set of three dice, III, IV and V such that
Then:
Warren Buffett is known to be a fan of intransitive dice. In the book Fortune's Formula: The Untold Story of the Scientific Betting System that Beat the Casinos and Wall Street, a discussion between him and Edward Thorp is described. Buffett and Thorp discussed their shared interest in intransitive dice. "These are a mathematical curiosity, a type of 'trick' dice that confound most people's ideas about probability."
Buffett once attempted to win a game of dice with Bill Gates using intransitive dice. "Buffett suggested that each of them choose one of the dice, then discard the other two. They would bet on who would roll the highest number most often. Buffett offered to let Gates pick his die first. This suggestion instantly aroused Gates's curiosity. He asked to examine the dice, after which he demanded that Buffett choose first." [7]
In 2010, Wall Street Journal magazine quoted Sharon Osberg, Buffett's bridge partner, saying that when she first visited his office 20 years earlier, he tricked her into playing a game with intransitive dice that could not be won and "thought it was hilarious". [8]
A number of people have introduced variations of intransitive dice where one can compete against more than one opponent.
Oskar van Deventer introduced a set of seven dice (all faces with probability 1/6) as follows: [9]
One can verify that A beats {B,C,E}; B beats {C,D,F}; C beats {D,E,G}; D beats {A,E,F}; E beats {B,F,G}; F beats {A,C,G}; G beats {A,B,D}. Consequently, for arbitrarily chosen two dice there is a third one that beats both of them. Namely,
Whatever the two opponents choose, the third player will find one of the remaining dice that beats both opponents' dice.
Dr. James Grime discovered a set of five dice as follows: [10] [11]
One can verify that, when the game is played with one set of Grime dice:
However, when the game is played with two such sets, then the first chain remains the same, except that D beats C, but the second chain is reversed (i.e. A beats D beats B beats E beats C beats A). Consequently, whatever dice the two opponents choose, the third player can always find one of the remaining dice that beats them both (as long as the player is then allowed to choose between the one-die option and the two-die option):
Sets chosen by opponents | Winning set of dice | ||
---|---|---|---|
Type | Number | ||
A | B | E | 1 |
A | C | E | 2 |
A | D | C | 2 |
A | E | D | 1 |
B | C | A | 1 |
B | D | A | 2 |
B | E | D | 2 |
C | D | B | 1 |
C | E | B | 2 |
D | E | C | 1 |
A four-player set has not yet been discovered, but it was proved that such a set would require at least 19 dice. [10] [12]
Tetrahedra can be used as dice with four possible results.
P(A > B) = P(B > C) = P(C > A) = 9/16
The following tables show all possible outcomes:
B A | 2 | 6 | 6 | 6 |
---|---|---|---|---|
1 | B | B | B | B |
4 | A | B | B | B |
7 | A | A | A | A |
7 | A | A | A | A |
In "A versus B", A wins in 9 out of 16 cases.
C B | 3 | 5 | 5 | 8 |
---|---|---|---|---|
2 | C | C | C | C |
6 | B | B | B | C |
6 | B | B | B | C |
6 | B | B | B | C |
In "B versus C", B wins in 9 out of 16 cases.
A C | 1 | 4 | 7 | 7 |
---|---|---|---|---|
3 | C | A | A | A |
5 | C | C | A | A |
5 | C | C | A | A |
8 | C | C | C | C |
In "C versus A", C wins in 9 out of 16 cases.
P(A > B) = P(B > C) = 10/16, P(C > A) = 9/16
In analogy to the intransitive six-sided dice, there are also dodecahedra which serve as intransitive twelve-sided dice. The points on each of the dice result in the sum of 114. There are no repetitive numbers on each of the dodecahedra.
Miwin’s dodecahedra (set 1) win cyclically against each other in a ratio of 35:34.
The miwin’s dodecahedra (set 2) win cyclically against each other in a ratio of 71:67.
Set 1:
D III | purple | 1 | 2 | 5 | 6 | 7 | 9 | 10 | 11 | 14 | 15 | 16 | 18 | ||||||
D IV | red | 1 | 3 | 4 | 5 | 8 | 9 | 10 | 12 | 13 | 14 | 17 | 18 | ||||||
D V | dark grey | 2 | 3 | 4 | 6 | 7 | 8 | 11 | 12 | 13 | 15 | 16 | 17 |
Set 2:
D VI | cyan | 1 | 2 | 3 | 4 | 9 | 10 | 11 | 12 | 13 | 14 | 17 | 18 | ||||||
D VII | pear green | 1 | 2 | 5 | 6 | 7 | 8 | 9 | 10 | 15 | 16 | 17 | 18 | ||||||
D VIII | light grey | 3 | 4 | 5 | 6 | 7 | 8 | 11 | 12 | 13 | 14 | 15 | 16 |
It is also possible to construct sets of intransitive dodecahedra such that there are no repeated numbers and all numbers are primes. Miwin’s intransitive prime-numbered dodecahedra win cyclically against each other in a ratio of 35:34.
Set 1: The numbers add up to 564.
PD 11 | grey to blue | 13 | 17 | 29 | 31 | 37 | 43 | 47 | 53 | 67 | 71 | 73 | 83 |
PD 12 | grey to red | 13 | 19 | 23 | 29 | 41 | 43 | 47 | 59 | 61 | 67 | 79 | 83 |
PD 13 | grey to green | 17 | 19 | 23 | 31 | 37 | 41 | 53 | 59 | 61 | 71 | 73 | 79 |
Set 2: The numbers add up to 468.
PD 1 | olive to blue | 7 | 11 | 19 | 23 | 29 | 37 | 43 | 47 | 53 | 61 | 67 | 71 |
PD 2 | teal to red | 7 | 13 | 17 | 19 | 31 | 37 | 41 | 43 | 59 | 61 | 67 | 73 |
PD 3 | purple to green | 11 | 13 | 17 | 23 | 29 | 31 | 41 | 47 | 53 | 59 | 71 | 73 |
Dice are small, throwable objects with marked sides that can rest in multiple positions. They are used for generating random values, commonly as part of tabletop games, including dice games, board games, role-playing games, and games of chance.
A random variable is a mathematical formalization of a quantity or object which depends on random events. The term 'random variable' in its mathematical definition refers to neither randomness nor variability but instead is a mathematical function in which
A statistical model is a mathematical model that embodies a set of statistical assumptions concerning the generation of sample data. A statistical model represents, often in considerably idealized form, the data-generating process. When referring specifically to probabilities, the corresponding term is probabilistic model. All statistical hypothesis tests and all statistical estimators are derived via statistical models. More generally, statistical models are part of the foundation of statistical inference. A statistical model is usually specified as a mathematical relationship between one or more random variables and other non-random variables. As such, a statistical model is "a formal representation of a theory".
In mathematics, a binary relation R on a set X is transitive if, for all elements a, b, c in X, whenever R relates a to b and b to c, then R also relates a to c.
Pig is a simple dice game first described in print by John Scarne in 1945. Players take turns to roll a single dice as many times as they wish, adding all roll results to a running total, but losing their gained score for the turn if they roll a 1.
In mathematics, intransitivity is a property of binary relations that are not transitive relations. This may include any relation that is not transitive, or the stronger property of antitransitivity, which describes a relation that is never transitive.
Liar's dice is a class of dice games for two or more players requiring the ability to deceive and to detect an opponent's deception. In "single hand" liar's dice games, each player has a set of dice, all players roll once, and the bids relate to the dice each player can see plus all the concealed dice. In "common hand" games, there is one set of dice which is passed from player to player. The bids relate to the dice as they are in front of the bidder after selected dice have been re-rolled. Originating during the 15th century, the game subsequently spread to Latin American and European countries. In 1993, a variant, Call My Bluff, won the Spiel des Jahres.
In decision theory, economics, and probability theory, the Dutch book arguments are a set of results showing that agents must satisfy the axioms of rational choice to avoid a kind of self-contradiction called a Dutch book. A Dutch book or money pump is a set of bets that ensures a guaranteed loss, i.e. the gambler will lose money no matter what happens. A set of beliefs and preferences is called coherent if it cannot result in a Dutch book.
Cee-lo is a gambling game played with three six-sided dice. There is not one standard set of rules, but there are some constants that hold true to all sets of rules. The name comes from the Chinese Sì-Wŭ-Liù (四五六), meaning "four-five-six". In America it is also called "See-Low," "Four-Five-Six," "The Three Dice Game," "Roll-off!," and by several alternative spellings, as well as simply "Dice." In China it is also called "Sān Liù Bàozi" (三六豹子), or "Three-Six Leopards". In Japan, it is known as "Chinchiro" (チンチロ) or "Chinchirorin" (チンチロリン).
In graph theory, a tournament is a directed graph with exactly one edge between each two vertices, in one of the two possible directions. Equivalently, a tournament is an orientation of an undirected complete graph. The name tournament comes from interpreting the graph as the outcome of a round-robin tournament, a game where each player is paired against every other exactly once. In a tournament, the vertices represent the players, and the edges between players point from the winner to the loser.
Dice notation is a system to represent different combinations of dice in wargames and tabletop role-playing games using simple algebra-like notation such as d8+2.
Poker dice are dice which, instead of having number pips, have representations of playing cards upon them. Poker dice have six sides, one each of an Ace, King, Queen, Jack, 10, and 9, and are used to form a poker hand.
Bootstrapping is a procedure for estimating the distribution of an estimator by resampling one's data or a model estimated from the data. Bootstrapping assigns measures of accuracy to sample estimates. This technique allows estimation of the sampling distribution of almost any statistic using random sampling methods.
Bradley Efron is an American statistician. Efron has been president of the American Statistical Association (2004) and of the Institute of Mathematical Statistics (1987–1988). He is a past editor of the Journal of the American Statistical Association, and he is the founding editor of the Annals of Applied Statistics. Efron is also the recipient of many awards.
Penney's game, named after its inventor Walter Penney, is a binary (head/tail) sequence generating game between two players. Player A selects a sequence of heads and tails, and shows this sequence to player B. Player B then selects another sequence of heads and tails of the same length. Subsequently, a fair coin is tossed until either player A's or player B's sequence appears as a consecutive subsequence of the coin toss outcomes. The player whose sequence appears first wins.
An intransitive or non-transitive game is a zero-sum game in which pairwise competitions between the strategies contain a cycle. If strategy A beats strategy B, B beats C, and C beats A, then the binary relation "to beat" is intransitive, since transitivity would require that A beat C. The terms "transitive game" or "intransitive game" are not used in game theory, however.
Miwin's Dice are a set of nontransitive dice invented in 1975 by the physicist Michael Winkelmann. They consist of three different dice with faces bearing numbers from one to nine; opposite faces sum to nine, ten or eleven. The numbers on each die give the sum of 30 and have an arithmetic mean of five.
A continuous game is a mathematical concept, used in game theory, that generalizes the idea of an ordinary game like tic-tac-toe or checkers (draughts). In other words, it extends the notion of a discrete game, where the players choose from a finite set of pure strategies. The continuous game concepts allows games to include more general sets of pure strategies, which may be uncountably infinite.
In economics, and in other social sciences, preference refers to an order by which an agent, while in search of an "optimal choice", ranks alternatives based on their respective utility. Preferences are evaluations that concern matters of value, in relation to practical reasoning. Individual preferences are determined by taste, need, ..., as opposed to price, availability or personal income. Classical economics assumes that people act in their best (rational) interest. In this context, rationality would dictate that, when given a choice, an individual will select an option that maximizes their self-interest. But preferences are not always transitive, both because real humans are far from always being rational and because in some situations preferences can form cycles, in which case there exists no well-defined optimal choice. An example of this is Efron dice.
Stochastic transitivity models are stochastic versions of the transitivity property of binary relations studied in mathematics. Several models of stochastic transitivity exist and have been used to describe the probabilities involved in experiments of paired comparisons, specifically in scenarios where transitivity is expected, however, empirical observations of the binary relation is probabilistic. For example, players' skills in a sport might be expected to be transitive, i.e. "if player A is better than B and B is better than C, then player A must be better than C"; however, in any given match, a weaker player might still end up winning with a positive probability. Tightly matched players might have a higher chance of observing this inversion while players with large differences in their skills might only see these inversions happen seldom. Stochastic transitivity models formalize such relations between the probabilities and the underlying transitive relation.