中文
相关论文

相关论文: Concerning an adversarial version of the Last-Succ…

200 篇论文

Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…

组合数学 · 数学 2008-08-06 Terence Tao , Van Vu

Assume that letters (from a finite alphabet) in a text form a Markov chain. We track two distinct words, $U$ and $D$. A gambler gains 1 point for each occurrence of $U$ (including overlapping occurrences) and loses 1 point for each…

概率论 · 数学 2025-06-03 Zhiyi Chi , Vladimir Pozdnyakov

In this paper we study a variant of the Nuel game (a generalization of the duel) which is played in turns by $N$ players. In each turn a single player must fire at one of the other players and has a certain probability of hitting and…

离散数学 · 计算机科学 2025-07-01 S. Mastrakoulis , Ath. Kehagias

Lionel Levine's hat challenge has $t$ players, each with a (very large, or infinite) stack of hats on their head, each hat independently colored at random black or white. The players are allowed to coordinate before the random colors are…

组合数学 · 数学 2021-03-10 Ehud Friedgut , Gil Kalai , Guy Kindler

We frame the meta-learning of prediction procedures as a search for an optimal strategy in a two-player game. In this game, Nature selects a prior over distributions that generate labeled data consisting of features and an associated…

机器学习 · 统计学 2020-09-29 Alex Luedtke , Incheoul Chung , Oleg Sofrygin

Penney's game is a two player zero-sum game in which each player chooses a three-flip pattern of heads and tails and the winner is the player whose pattern occurs first in repeated tosses of a fair coin. Because the players choose…

最优化与控制 · 数学 2019-04-24 Joshua B. Miller

Consider $2k-1$ voters, each of which has a preference ranking between $n$ given alternatives. An alternative $A$ is called a Condorcet winner, if it wins against every other alternative $B$ in majority voting (meaning that for every other…

理论经济学 · 经济学 2022-03-28 Lisa Sauermann

We consider graph games of infinite duration with winning conditions in parameterized linear temporal logic, where the temporal operators are equipped with variables for time bounds. In model checking such specifications were introduced as…

计算机科学与博弈论 · 计算机科学 2011-06-08 Martin Zimmermann

The Bernoulli convolution with parameter $\lambda\in(0,1)$ is the measure on $\bf R$ that is the distribution of the random power series $\sum\pm\lambda^n$, where $\pm$ are independent fair coin-tosses. This paper surveys recent progress on…

经典分析与常微分方程 · 数学 2016-08-16 Péter P. Varjú

Let game B be Toral's cooperative Parrondo game with (one-dimensional) spatial dependence, parameterized by N (3 or more) and p_0, p_1, p_2, p_3 in [0,1], and let game A be the special case p_0=p_1=p_2=p_3=1/2. In previous work we…

概率论 · 数学 2013-01-16 S. N. Ethier , Jiyeon Lee

The following problem is considered. Two players are each required to allocate a quota of~$n$ counters among~$k$ boxes labelled~$1,2,\ldots,k$. At times $t=1,2,3,\ldots$ a random box is identified; the probability of choosing box~$i$…

组合数学 · 数学 2022-10-06 Robin K. S. Hankin

We study the effects of randomness on competitions based on an elementary random process in which there is a finite probability that a weaker team upsets a stronger team. We apply this model to sports leagues and sports tournaments, and…

物理与社会 · 物理学 2013-04-02 E. Ben-Naim , N. W. Hengartner , S. Redner , F. Vazquez

Two sequential estimators are proposed for the odds p/(1-p) and log odds log(p/(1-p)) respectively, using independent Bernoulli random variables with parameter p as inputs. The estimators are unbiased, and guarantee that the variance of the…

统计理论 · 数学 2025-01-07 Luis Mendo

One-sided confidence intervals are presented for the average of non-identical Bernoulli parameters. These confidence intervals are expressed as analytical functions of the total number of Bernoulli games won, the number of rounds and the…

统计理论 · 数学 2022-12-27 Jean-Daniel Bancal , Pavel Sekatski

In this paper we review some of the main results obtained in the field of truels. A "truel" is a generalization of a duel involving three players. Depending on the rules used for chosing the players, we may distinguish between the random,…

概率论 · 数学 2007-05-23 Pau Amengual , Raúl Toral

In two-player finite-state stochastic games of partial observation on graphs, in every state of the graph, the players simultaneously choose an action, and their joint actions determine a probability distribution over the successor states.…

计算机科学与博弈论 · 计算机科学 2011-07-13 Krishnendu Chatterjee , Laurent Doyen

We consider the one-round Voronoi game, where player one (``White'', called ``Wilma'') places a set of n points in a rectangular area of aspect ratio r <=1, followed by the second player (``Black'', called ``Barney''), who places the same…

计算几何 · 计算机科学 2007-05-23 Sandor P. Fekete , Henk Meijer

We provide a reason for Bayesian updating, in the Bernoulli case, even when it is assumed that observations are independent and identically distributed with a fixed but unknown parameter $\theta_0$. The motivation relies on the use of loss…

统计理论 · 数学 2010-06-08 Pier Giovanni Bissiri , Stephen G. Walker

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…

物理与社会 · 物理学 2007-08-29 Dmitriy Cherkashin , J. Doyne Farmer , Seth Lloyd

Prophet inequalities are a central object of study in optimal stopping theory. A gambler is sent values in an online fashion, sampled from an instance of independent distributions, in an adversarial, random or selected order, depending on…

数据结构与算法 · 计算机科学 2024-11-05 Giordano Giambartolomei , Frederik Mallmann-Trenn , Raimundo Saona