English
Related papers

Related papers: Comparing dealing methods with repeating cards

200 papers

The game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from…

Probability · Mathematics 2012-08-27 Daniel J. Velleman , Gregory S. Warrington

We study a family of shuffling operators on the symmetric group $S_n$, which includes the top-to-random shuffle. The general shuffling scheme consists of removing one card at a time from the deck (according to some probability distribution)…

Combinatorics · Mathematics 2024-05-30 Darij Grinberg , Nadia Lafrenière

We study the two-player coupon-collector competition in which two independent collectors draw one coupon each per round from a set of $d$ equally likely coupon types. Myers and Wilf gave finite formulae for several two-player events and…

Probability · Mathematics 2026-05-12 Christopher D. Long

In the top to random shuffle, the first a cards are removed from a deck of n cards 12 \cdots n and then inserted back into the deck. This action can be studied by treating the top to random shuffle as an element B_a, which we define…

Combinatorics · Mathematics 2016-12-20 Roger Tian

In many social dilemmas, individuals tend to generate a situation with low payoffs instead of a system optimum ("tragedy of the commons"). Is the routing of traffic a similar problem? In order to address this question, we present…

Physics and Society · Physics 2007-05-23 Dirk Helbing , Martin Schonhof , Hans-Ulrich Stark , Janusz A. Holyst

In the game of Scrabble, letter tiles are drawn uniformly at random from a bag. The variability of possible draws as the game progresses is a source of variation that makes it more likely for an inferior player to win a head-to-head match…

Applications · Statistics 2011-11-02 Andrew C. Thomas

Card games are widely used to study sequential decision-making under uncertainty, with real-world analogues in negotiation, finance, and cybersecurity. These games typically fall into three categories based on the flow of control: strictly…

Computer Science and Game Theory · Computer Science 2025-10-31 Will Wolf

We consider the following game that has been used as a way of testing claims of extrasensory perception (ESP). One is given a deck of $mn$ cards comprised of $n$ distinct types each of which appears exactly $m$ times: this deck is shuffled…

Probability · Mathematics 2022-11-17 Andrea Ottolini , Stefan Steinerberger

We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a)…

Computer Science and Game Theory · Computer Science 2015-05-19 Krishnendu Chatterjee , Laurent Doyen , Hugo Gimbert , Thomas A. Henzinger

We study the problem of scheduling asynchronous round-robin tournaments. We consider three measures of a schedule that concern the quality and fairness of a tournament. We show that the schedule generated by the well-known "circle design"…

Combinatorics · Mathematics 2018-04-19 Warut Suksompong

We study a sequential decision-making model where a set of items is repeatedly matched to the same set of agents over multiple rounds. The objective is to determine a sequence of matchings that either maximizes the utility of the least…

Computer Science and Game Theory · Computer Science 2025-10-07 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

The authors (Cason, Friedman and Hopkins, Reviews of Economics Studies, 2014) claimed a result that the treatments (using simultaneous matching in discrete time) replicate previous results that exhibit weak or no cycles. After correct two…

Methodology · Statistics 2013-11-20 Zhijian Wang , Siqian Zhu , Bin Xu

Suppose that the outcomes of a roulette table are not entirely random, in the sense that there exists a successful betting strategy. Is there a successful `separable' strategy, in the sense that it does not use the winnings from betting on…

Logic · Mathematics 2019-04-18 George Barmpalias , Nan Fang , Andrew Lewis-Pye

Let a deck of n cards be shuffled by successively exchanging the cards in positions 1, 2, ..., n with cards in randomly chosen positions. We show that for n equal to 18 or greater, the identity permutation is the most likely. We prove a…

Combinatorics · Mathematics 2018-06-19 Daniel Goldstein , David Moews

In this paper we present a random shuffling scheme to apply with adaptive sorting algorithms. Adaptive sorting algorithms utilize the presortedness present in a given sequence. We have probabilistically increased the amount of presortedness…

Data Structures and Algorithms · Computer Science 2016-08-31 Md. Enamul Karim , Abdun Naser Mahmood

We study a contextual version of the repeated brokerage problem. In each interaction, two traders with private valuations for an item seek to buy or sell based on the learner's-a broker-proposed price, which is informed by some contextual…

Machine Learning · Statistics 2025-03-11 François Bachoc , Tommaso Cesari , Roberto Colomboni

This article, based on a talk, treats some elementary, but not completely simple examples from probability. They concern multiple birthday coincidences, throwing dice, the combinatorics of the German card game "Doppelkopf", and the…

History and Overview · Mathematics 2017-11-17 Edgar M. E. Wermuth

The purpose of this work is to explore the role that arbitrage opportunities play in pricing financial derivatives. We use a non-equilibrium model to set up a stochastic portfolio, and for the random arbitrage return, we choose a stationary…

General Mathematics · Mathematics 2015-06-26 Sergei Fedotov , Stephanos Panayides

The game of Hex has two players who take turns placing stones of their respective colors on the hexagons of a rhombus-shaped hexagonal grid. Black wins by completing a crossing between two opposite edges, while White wins by completing a…

Probability · Mathematics 2009-02-25 Yuval Peres , Oded Schramm , Scott Sheffield , David B. Wilson

We treat three cubic recurrences, two of which generalize the famous iterated map $x \mapsto x (1-x)$ from discrete chaos theory. A feature of each asymptotic series developed here is a constant, dependent on the initial condition but…

Dynamical Systems · Mathematics 2025-07-16 Steven Finch
‹ Prev 1 4 5 6 7 8 10 Next ›