English
Related papers

Related papers: Alice and Bob on $\Bbb X$: reversal, coupling, ren…

200 papers

We analyse the common information problem for the generalised Gray-Wyner problem. We aim to explore the problem and solution in relation to the non-orthogonality among the source decoders' components. We consider a simple networked control…

Information Theory · Computer Science 2022-01-07 Makan Zamanipour

We consider a Polya urn, started with b black and w white balls, where b>w. We compute the probability that there are ever the same number of black and white balls in the urn, and show that it is twice the probability of getting no more…

Probability · Mathematics 2012-09-17 Timothy C. Wallstrom

The MandM Game involves two players who begin with I1 and I2 MandM's. During each round, each player tosses a fair coin: if the coin lands heads, that player eats one MandM, and if it lands tails, the player does not eat. If, at the end of…

Probability · Mathematics 2026-03-19 Snehesh Das , Steven J. Miller , Geremias Polanco , Yilong Wu , Wang Xiaochen , April Yang , Chris Yao

Winners-take-all situations introduce an incentive for agents to diversify their behavior, since doing so will result in splitting an eventual price with fewer people. At the same time, when the payoff of a process depends on a parameter…

Computer Science and Game Theory · Computer Science 2019-06-11 Abel Molina

The $(m,b)$ Maker-Breaker percolation game on $(\mathbb{Z}^2)_p$, introduced by Day and Falgas-Ravry, is played in the following way. Before the game starts, each edge of $\mathbb{Z}^2$ is removed independently with probability $1-p$. After…

Probability · Mathematics 2024-02-28 Vojtěch Dvořák , Adva Mond , Victor Souza

We describe a simple scheme that allows an agent to learn about its environment in an unsupervised manner. Our scheme pits two versions of the same agent, Alice and Bob, against one another. Alice proposes a task for Bob to complete; and…

Machine Learning · Computer Science 2018-05-01 Sainbayar Sukhbaatar , Zeming Lin , Ilya Kostrikov , Gabriel Synnaeve , Arthur Szlam , Rob Fergus

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 existence of different notions of value in two-person zero-sum repeated games where the state evolves and players receive signals. We provide some examples showing that the limsup value (and the uniform value) may not exist in…

Optimization and Control · Mathematics 2016-01-08 Hugo Gimbert , Jérôme Renault , Sylvain Sorin , Xavier Venel , Wiesław Zielonka

The Labouchere gambling system is hypothesized to increase the probability of winning a predetermined arbitrary profit in a gambling system such as a coin flip or a roulette game in which both payouts and odds are 1:1. However, use of the…

General Finance · Quantitative Finance 2017-07-04 Jake Billings , Sebastian Del Barco

Consider the following Simultaneous Message Passing (SMP) model for computing a relation f subset of X x Y x Z. In this model Alice, on input x in X and Bob, on input y in Y, send one message each to a third party Referee who then outputs a…

Distributed, Parallel, and Cluster Computing · Computer Science 2009-02-26 Rahul Jain , Hartmut Klauck

We show how to simulate a roll of a fair $n$-sided die by one flip of a biased coin with probability $1/n$ of coming up heads, followed by $3\lfloor\log_2 n \rfloor+1$ flips of a fair coin.

Combinatorics · Mathematics 2015-06-02 Giovanni Viglietta

Suppose Alice and Bob receive strings $X=(X_1,...,X_n)$ and $Y=(Y_1,...,Y_n)$ each uniformly random in $[s]^n$ but so that $X$ and $Y$ are correlated . For each symbol $i$, we have that $Y_i = X_i$ with probability $1-\eps$ and otherwise…

Information Theory · Computer Science 2012-08-30 Siu On Chan , Elchanan Mossel , Joe Neeman

Picking sequences are well-established methods for allocating indivisible goods. Among the various picking sequences, recursively balanced picking sequences -- whereby each agent picks one good in every round -- are notable for guaranteeing…

Computer Science and Game Theory · Computer Science 2025-12-22 Karen Frilya Celine , Warut Suksompong , Sheung Man Yuen

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

Ann likes oranges much more than apples; Bob likes apples much more than oranges. Tomorrow they will receive one fruit that will be an orange or an apple with equal probability. Giving one half to each agent is fair for each realization of…

Computer Science and Game Theory · Computer Science 2021-01-12 Anna Bogomolnaia , Herve Moulin , Fedor Sandomirskiy

We characterize the initial positions from which the first player has a winning strategy in a certain two-player game. This provides a generalization of Hall's theorem. Vizing's edge coloring theorem follows from a special case.

Combinatorics · Mathematics 2012-10-23 Landon Rabern

We consider statistical estimations of a matrix product over the integers in a distributed setting, where we have two parties Alice and Bob; Alice holds a matrix $A$ and Bob holds a matrix $B$, and they want to estimate statistics of $A…

Data Structures and Algorithms · Computer Science 2018-07-04 David P. Woodruff , Qin Zhang

`Twenty questions' is a guessing game played by two players: Bob thinks of an integer between $1$ and $n$, and Alice's goal is to recover it using a minimal number of Yes/No questions. Shannon's entropy has a natural interpretation in this…

Data Structures and Algorithms · Computer Science 2018-11-07 Yuval Dagan , Yuval Filmus , Daniel Kane , Shay Moran

A binary game is introduced and analysed. N players have to choose one of the two sides independently and those on the minority side win. Players uses a finite set of ad hoc strategies to make their decision, based on the past record. The…

adap-org · Physics 2015-06-24 Damien Challet , Yi-Cheng Zhang

We propose a communication protocol exploiting correlations between two events with a definite time-ordering: a) the outcome of a {\em weak measurement} on a spin, and b) the outcome of a subsequent ordinary measurement on the spin. In our…

Quantum Physics · Physics 2009-10-31 Alonso Botero , Benni Reznik
‹ Prev 1 8 9 10 Next ›