English
Related papers

Related papers: A probabilistic look at the infinite hat-guessing …

200 papers

This paper presents an in-depth statistical analysis of an experiment designed to measure the extent to which players in a simple game behave according to a popular behavioral economic model. The p-beauty contest is a multi-player number…

Applications · Statistics 2014-09-18 P. Richard Hahn , Indranil Goswami , Carl Mela

"Guess Who?" is a popular two player game where players ask "Yes"/"No" questions to search for their opponent's secret identity from a pool of possible candidates. This is modeled as a simple stochastic game. Using this model, the optimal…

Probability · Mathematics 2025-11-24 Mihai Nica

In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates…

Computer Science and Game Theory · Computer Science 2017-02-22 Nicolas Basset , Gilles Geeraerts , Jean-François Raskin , Ocan Sankur

Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…

Logic in Computer Science · Computer Science 2016-11-29 Romain Brenguier , Guillermo A. Pérez , Jean-François Raskin , Ocan Sankur

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

Optimization and Control · Mathematics 2026-02-17 Dean Kraizberg

We start with the well-known game below: Two players hold a sheet of paper to their forehead on which a positive integer is written. The numbers are consecutive and each player can only see the number of the other one. In each time step,…

Combinatorics · Mathematics 2013-02-26 Felix Günther , Irina Mustata

We consider a two-player search game on a tree $T$. One vertex (unknown to the players) is randomly selected as the target. The players alternately guess vertices. If a guess $v$ is not the target, then both players are informed in which…

Probability · Mathematics 2022-02-07 Ravi B. Boppana , Joel Brewster Lewis

We consider a two-player game in which the first player (the Guesser) tries to guess, edge-by-edge, the path that second player (the Chooser) takes through a directed graph. At each step, the Guesser makes a wager as to the correctness of…

Probability · Mathematics 2009-07-14 Marcus Pendergrass

Two-player, turn-based, stochastic games with reachability conditions are considered, where the maximizer has no information (he is blind) and is restricted to deterministic strategies whereas the minimizer is perfectly informed. We ask the…

Computer Science and Game Theory · Computer Science 2016-05-26 Edon Kelmendi , Hugo Gimbert

For a topological space $X$ and a point $x \in X$, consider the following game -- related to the property of $X$ being countably tight at $x$. In each inning $n\in\omega$, the first player chooses a set $A_n$ that clusters at $x$, and then…

General Topology · Mathematics 2016-04-01 Leandro F. Aurichi , Angelo Bella , Rodrigo R. Dias

The $k$-majority game is played with $n$ numbered balls, each coloured with one of two colours. It is given that there are at least $k$ balls of the majority colour, where $k$ is a fixed integer greater than $n/2$. On each turn the player…

Combinatorics · Mathematics 2014-02-25 John R. Britnell , Mark Wildon

An unknown positive number of items arrive at independent uniformly distributed times in the interval [0,1] to a selector, whose task is to pick online the last one. We show that under the assumption of an adversary determining the number…

Computer Science and Game Theory · Computer Science 2011-04-18 Johan Wästlund

In repeated-game applications where both the collusive and non-collusive outcomes can be supported as equilibria, researchers must resolve underlying selection questions if theory will be used to understand counterfactual policies. One…

General Economics · Economics 2021-01-18 Emanuel Vespa , Taylor Weidman , Alistair J. Wilson

Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in which one player tries to achieve a reachability objective in $n$ games (on the same finite arena) simultaneously by broadcasting actions, and where the opponent has full…

Logic in Computer Science · Computer Science 2019-09-17 Corto Mascle , Mahsa Shirmohammadi , Patrick Totzke

In the Penney-Ante game, Player I chooses a head/tail string of a predetermined length $n\ge3$. Player II, upon seeing Player I's choice, chooses another head/tail string of the same length. A coin is then tossed repeatedly and the player…

Combinatorics · Mathematics 2021-07-16 Reed Phillips , A. J. Hildebrand

We propose a two-agent game wherein a questioner must be able to conjure discerning questions between sentences, incorporate responses from an answerer, and keep track of a hypothesis state. The questioner must be able to understand the…

Computation and Language · Computer Science 2019-08-14 Peter Potash , Kaheer Suleman

We identify a choiceless variation of the box game paradox, in which players predict unknown real numbers with near-perfect accuracy despite lacking any useful information. We also verify that choice is necessary in the solution of the…

Logic · Mathematics 2023-01-09 Elliot Glazer

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

At the beginning of 2022, a simplistic word-guessing game took the world by storm and was further adapted to many languages beyond the original English version. In this paper, we examine the strategies of daily word-guessing game players…

Computation and Language · Computer Science 2024-12-16 Matīss Rikters , Sanita Reinsone

The majority problem is a special case of the heavy hitters problem. Given a collection of coloured balls, the task is to identify the majority colour or state that no such colour exists. Whilst the special case of two-colours has been well…

Data Structures and Algorithms · Computer Science 2018-01-08 Anthony Kleerekoper