English
Related papers

Related papers: Parrondo games with spatial dependence and a relat…

200 papers

Trust and reciprocation of it form the foundation of economic, social and other interactions. While the Trust Game is widely used to study these concepts for interactions between two players, often alternating different roles (i.e.,…

Physics and Society · Physics 2025-05-21 Ik Soo Lim , Naoki Masuda

The antique Mills Futurity slot machine has two unusual features. First, if a player loses 10 times in a row, the 10 lost coins are returned. Second, the payout distribution varies from coup to coup in a manner that is nonrandom and…

Probability · Mathematics 2010-10-18 S. N. Ethier , Jiyeon Lee

In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is…

Computer Science and Game Theory · Computer Science 2016-06-27 Valerio Capraro , Joseph Y. Halpern

We study the effect of quantum noise on history dependent quantum Parrondo's games by taking into account different noise channels. Our calculations show that entanglement can play a crucial role in quantum Parrondo's games. It is seen that…

Quantum Physics · Physics 2012-02-13 Salman Khan , M. Ramzan , M. K. Khan

Player ONE chooses a meager set and player TWO, a nowhere dense set per inning. They play $\omega$ many innings. ONE's consecutive choices must form a (weakly) increasing sequence. TWO wins if the union of the chosen nowhere dense sets…

Logic · Mathematics 2009-09-25 Marion Scheepers

Players are arranged on a regular lattice and coded with a specific strategy for a pre-defined game. Each player sums their payoffs from playing the game with each of their neighbors, and then adopts the strategy of the most successful…

Dynamical Systems · Mathematics 2015-08-03 Stewart D. Johnson

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

Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins…

Combinatorics · Mathematics 2016-07-12 J. Robert Johnson , Imre Leader , Mark Walters

We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…

Optimization and Control · Mathematics 2014-12-11 Jérôme Renault , Bruno Ziliotto

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 this work, we study the effectiveness of employing archetypal aperiodic sequencing -- namely Fibonacci, Thue-Morse, and Rudin-Shapiro -- on the Parrondian effect. From a capital gain perspective, our results show that these series do…

Physics and Society · Physics 2025-01-14 Marcelo A. Pires , Erveton P. Pinto , Rone N. da Silva , Sílvio M. Duarte Queirós

Consider a two-player game repeated N times. Player 1 can choose between two styles (for interpretability, offensive and defensive), whereas Player 2 uses a single fixed style. Let X N\,:= \#wins -\#losses for Player 1 after N games, and…

Computer Science and Game Theory · Computer Science 2026-04-20 Jonatha ANSELMI , Bruno Gaujal

n infinite two-player zero-sum game with a Borel winning set, in which the opponent's actions are monitored eventually but not necessarily immediately after they are played, is determined. The proof relies on a representation of the game as…

Logic · Mathematics 2011-07-06 Eran Shmaya

A tournament on $n$ agents is a complete oriented graph with the agents as vertices and edges that describe the win-loss outcomes of the $\binom{n}{2}$ matches played between each pair of agents. The winner of a tournament is determined by…

Computer Science and Game Theory · Computer Science 2024-08-21 David Pennock , Ariel Schvartzman , Eric Xue

Two-player graph games are a fundamental model for reasoning about the interaction of agents. These games are played between two players who move a token along a graph. In bidding games, the players have some monetary budget, and at each…

Computer Science and Game Theory · Computer Science 2024-12-24 Shaull Almagor , Guy Avni , Neta Dafni

We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…

Computer Science and Game Theory · Computer Science 2016-02-25 Kai Jin , Pingzhong Tang , Shiteng Chen

Existing multi-objective reinforcement learning (MORL) algorithms do not account for objectives that arise from players with differing beliefs. Concretely, consider two players with different beliefs and utility functions who may cooperate…

Artificial Intelligence · Computer Science 2017-05-16 Andrew Critch

The $N$-player quantum game is analyzed in the context of an Einstein-Podolsky-Rosen (EPR) experiment. In this setting, a player's strategies are not unitary transformations as in alternate quantum game-theoretic frameworks, but a classical…

Quantum Physics · Physics 2012-11-16 James M. Chappell , Azhar Iqbal , Derek Abbott

In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is…

Computer Science and Game Theory · Computer Science 2014-11-05 Valerio Capraro , Joseph Y. Halpern

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…

Optimization and Control · Mathematics 2019-04-24 Joshua B. Miller
‹ Prev 1 4 5 6 7 8 10 Next ›