中文
相关论文

相关论文: Exact probabilities for three and four dice in the…

200 篇论文

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…

概率论 · 数学 2020-10-27 Jan Hązła , Elchanan Mossel , Nathan Ross , Guangqu Zheng

We construct irreducible balanced non-transitive sets of $n$-sided dice for any positive integer $n$, which was raised in \cite[Question 5.2]{SS17}. One main tool of the construction is to study so-called fair sets of dice. Furthermore, we…

概率论 · 数学 2020-11-11 Injo Hur , Yeansu Kim

Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decision-making and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning…

计算机科学与博弈论 · 计算机科学 2016-04-19 Krishnendu Chatterjee , Rasmus Ibsen-Jensen , Josef Tkadlec

Answering a pair of questions of Conrey, Gabbard, Grant, Liu, and Morrison, we prove that a triplet of dice drawn from the multiset model are intransitive with probability $1/4+o(1)$ and the probability a random pair of dice tie tends…

概率论 · 数学 2023-02-23 Ashwin Sah , Mehtaab Sawhney

Have you ever taken a disputed decision by tossing a coin and checking its landing side? This ancestral "heads or tails" practice is still widely used when facing undecided alternatives since it relies on the intuitive fairness of…

经典物理 · 物理学 2024-11-26 Lluís Hernández-Navarro , Jordi Piñero

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…

概率论 · 数学 2024-11-08 Elisabetta Cornacchia , Jan Hązła

The problem of creating a three-sided dice with the probability of it landing on each of its sides being equal to 1/3 has been around for many years. Various approaches have been attempted, but as different authors achieved at different…

动力系统 · 数学 2024-01-09 Anton Gaek , Artem Sukhov

Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…

计算机科学与博弈论 · 计算机科学 2020-02-18 Christian Saile , Warut Suksompong

This paper studies Ebert's hat problem for three and four players and two colors, where the probabilities of the colors may be different for each player. Our goal is to maximize the probability of winning the game and to describe winning…

组合数学 · 数学 2024-03-27 Theo van Uem

We study, in various special cases, total distributions on the product of a finite collection of finite probability spaces and, in particular, the question of when the probability distribution of each factor space is determined by the total…

历史与综述 · 数学 2013-09-02 Ian Morrison , David Swinarski

Many have dedicated their time trying to determine the ideal conditions for a cylinder to have equal probabilities of falling with one of its faces facing upwards or on its side. However, to this day, there is no concrete analysis of what…

经典物理 · 物理学 2023-11-30 M. N. C. Brustelo , M. M. Vivaldi , F. Marques

We find an exact formula for the number of directed 5-cycles in a tournament in terms of its edge score sequence. We use this formula to find both upper and lower bounds on the number of 5-cycles in any $n$-tournament. In particular, we…

组合数学 · 数学 2017-01-17 Natasha Komarov , John Mackey

We consider a simple dice game, which leads to an intriguing study of multinomial walks, with surprising and seemingly paradoxical properties. The winning and losing probabilities of a general version of the game are investigated via…

概率论 · 数学 2026-05-21 Gunther Leobacher , Alexander Steinicke

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…

无序系统与神经网络 · 物理学 2009-10-31 Johannes Berg

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…

历史与综述 · 数学 2023-08-03 Shamil Asgarli , Michael Hartglass , Daniel Ostrov , Byron Walden

Winning probabilities of The Hat Game (Ebert's Hat Problem) with three players and three colors are only known in the symmetric case: all probabilities of the colors are equal. This paper solves the asymmetric case: probabilities may be…

组合数学 · 数学 2021-11-25 Theo van Uem

Tournaments are graphs obtained by assigning a direction for every edge in an undirected complete graph. We give a formula for the number of isomorphism classes of vertex-transitive tournaments with prime order. For that, we introduce…

组合数学 · 数学 2023-01-25 Stefan Zetzsche

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

数论 · 数学 2015-09-30 Victor Volfson

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.…

经典物理 · 物理学 2014-07-24 G. A. T. Pender , M. Uhrin

In this paper, we derive the exact formula for the probability that three randomly and uniformly selected points from the interior of the unit cube form vertices of an obtuse triangle.

度量几何 · 数学 2025-01-22 Dominik Beck
‹ 上一页 1 2 3 10 下一页 ›