English
Related papers

Related papers: Comparing dealing methods with repeating cards

200 papers

We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…

Dynamical Systems · Mathematics 2020-05-28 Edgar Matias , Eduardo Silva

We consider random-turn positional games, introduced by Peres, Schramm, Sheffield and Wilson in 2007. A $p$-random-turn positional game is a two-player game, played the same as an ordinary positional game, except that instead of alternating…

Combinatorics · Mathematics 2014-08-26 Asaf Ferber , Michael Krivelevich , Gal Kronenberg

In a generalized tournament, players may have an arbitrary number of matches against each other and the outcome of the games is measured on a cardinal scale with a lower and upper bound. An axiomatic approach is applied to the problem of…

Computer Science and Game Theory · Computer Science 2019-06-20 László Csató

We offer some theorems, mainly of finiteness, for certain patterns in elliptical billiards, related to periodic trajectories. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in…

Number Theory · Mathematics 2021-07-20 Pietro Corvaja , Umberto Zannier

Unbiased shuffling algorithms, such as the Fisher-Yates shuffle, are often used for shuffle play in media players. These algorithms treat all items being shuffled equally regardless of how similar the items are to each other. While this may…

Social and Information Networks · Computer Science 2020-06-18 Kevin Su

A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \{1,...,n\}$. The permutation $\sigma$ is simply the sequence of cards in the order they are removed. This permutation…

Probability · Mathematics 2014-06-17 Nicholas F. Travers

In decentralized stochastic control (or stochastic team theory) and game theory, if there is a pre-defined order in a system in which agents act, the system is called \textit{sequential}, otherwise it is non-sequential. Much of the…

Optimization and Control · Mathematics 2025-08-05 Omar Mrani-Zentar , Ryan Simpson , Serdar Yüksel

A gambler walks into a hypothetical fair casino with a very real dollar bill, but by the time he leaves he's exchanged the dollar for a random amount of money. What is lost in the process? It may be that the gambler walks out at the end of…

Probability · Mathematics 2015-03-20 Paul Cuff , Thomas Cover , Gowtham Kumar , Lei Zhao

In his book "Mathematical Mind-Benders", Peter Winkler poses the following open problem, originally due to the first author: "[In the game Peer Pressure,] two players are dealt some number of cards, initially face up, each card carrying a…

Combinatorics · Mathematics 2010-01-08 Boris Alexeev , Jacob Tsimerman

In this paper we provide a novel family of stochastic orders that generalizes second order stochastic dominance, which we call the $\alpha,[a,b]$-concave stochastic orders. These stochastic orders are generated by a novel set of "very"…

Probability · Mathematics 2021-04-28 Bar Light , Andres Perlroth

Sequences of repeated gambles provide an experimental tool to characterize the risk preferences of humans or artificial decision-making agents. The difficulty of this inference depends on factors including the details of the gambles offered…

Artificial Intelligence · Computer Science 2023-08-15 James Price , Colm Connaughton

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…

Artificial Intelligence · Computer Science 2018-08-01 Aurélie Beynier , Sylvain Bouveret , Michel Lemaître , Nicolas Maudet , Simon Rey

In Texas hold'em, after an all-in bet is made and called before the flop, the turn, or the river, the two players sometimes agree to run it $n$ times, meaning that the remaining five, two, or one cards are dealt out not just once but $n$…

Probability · Mathematics 2024-09-20 Stewart N. Ethier

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then…

Combinatorics · Mathematics 2022-09-07 Pu Gao , Calum MacRury , Pawel Pralat

Game balancing is an important part of the (computer) game design process, in which designers adapt a game prototype so that the resulting gameplay is as entertaining as possible. In industry, the evaluation of a game is often based on…

Human-Computer Interaction · Computer Science 2016-03-15 Vanessa Volz , Günter Rudolph , Boris Naujoks

We consider an issue of much current concern: could fairness, an issue that is already difficult to guarantee, worsen when algorithms run much of our lives? We consider this in the context of resource-allocation problems, we show that…

Data Structures and Algorithms · Computer Science 2017-09-26 David G. Harris , Thomas Pensyl , Aravind Srinivasan , Khoa Trinh

In each round of a Swiss-system tournament, players of similar score are paired against each other. An intentional early loss therefore might lead to weaker opponents in later rounds and thus to a better final tournament result - a…

Computer Science and Game Theory · Computer Science 2023-02-22 Ágnes Cseh , Pascal Führlich , Pascal Lenzner

We consider a random billiard map, the one in which the standard specular reflection rule is replaced by a random reflection given by a Markov operator. We exhibit an invariant measure for random billiards on general tables. In the special…

Dynamical Systems · Mathematics 2022-04-04 Túlio Vales , Sônia Pinto-de-Carvalho

In this article, I will present a paradox whose purpose is to draw your attention to an important topic in finance, concerning the non-independence of the financial returns (non-ergodic hypothesis). In this paradox, we have two people…

General Finance · Quantitative Finance 2019-05-17 Andrea Berdondini

In a game of permutation wordle, a player attempts to guess a secret permutation in the fewest number of guesses possible. Previously, Samuel Kutin and Lawren Smithline (arXiv:2408.00903) introduced this game and proposed a strategy called…

Combinatorics · Mathematics 2026-01-12 Aurora Hiveley