English
Related papers

Related papers: Parrondo games with spatial dependence

200 papers

Spatial evolutionary games are studied with myopic players whose payoff interest, as a personal character, is tuned from selfishness to other-regarding preference via fraternity. The players are located on a square lattice and collect…

Physics and Society · Physics 2012-03-07 Gyorgy Szabo , Attila Szolnoki

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

Logic in Computer Science · Computer Science 2025-02-26 Pablo F. Castro , Pedro D'Argenio

We study two-player positional games where Maker and Breaker take turns to select a previously unoccupied number in $\{1,2,\ldots,n\}$. Maker wins if the numbers selected by Maker contain a solution to the equation \[…

Combinatorics · Mathematics 2024-06-26 Collier Gaiser , Paul Horn

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 study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of…

Computer Science and Game Theory · Computer Science 2015-09-18 Martin Gairing , Rahul Savani

We study 2-player impartial games of the form take-away which produce P-positions (second player winning positions) corresponding to complementary Beatty sequences, given by the continued fractions (1;k,1,k,1,...) and (k+1;k,1,k,1,...). Our…

Combinatorics · Mathematics 2013-02-04 Urban Larsson , Mike Weimerskirch

Parrondo's games manifest the apparent paradox where losing strategies can be combined to win and have generated significant multidisciplinary interest in the literature. Here we review two recent approaches, based on the Fokker-Planck…

Statistical Mechanics · Physics 2009-11-10 P. Amengual , A. Allison , R. Toral , D. Abbott

We discuss some aspects of Astumian suggestions that combination of biased games (Parrondo's paradox) can explain performance of molecular motors. Unfortunately the model is flawed by explicit asymmetry overlooked by the author. In…

Data Analysis, Statistics and Probability · Physics 2007-05-23 Edward W. Piotrowski , Jan Sladkowski

In this paper the results of a simulation of a prisoner's dilemma robin-round tournament are presented. In the tournament each participating strategy plays an iterated prisoner's dilemma against each other strategy (round-robin) and as a…

Computer Science and Game Theory · Computer Science 2014-02-10 Tobias Kretz

Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial…

Combinatorics · Mathematics 2012-02-28 Gabriel Beaulieu , Kyle Burke , Eric Duchêne

We investigate the computation of equilibria in extensive-form games where ex ante correlation is possible, focusing on correlated equilibria requiring the least amount of communication between the players and the mediator. Motivated by the…

Computer Science and Game Theory · Computer Science 2019-01-21 Andrea Celli , Stefano Coniglio , Nicola Gatti

Cooperative games with nonempty core are called balanced, and the set of balanced games is a polyhedron. Given a game with empty core, we look for the closest balanced game, in the sense of the (weighted) Euclidean distance, i.e., the…

Computer Science and Game Theory · Computer Science 2026-01-23 Pedro García-Segador , Michel Grabisch , Dylan Laplace Mermoud , Pedro Miranda

Solving parity games is a major building block for numerous applications in reactive program verification and synthesis. While they can be solved efficiently in practice, no known approach has a polynomial worst-case runtime complexity. We…

Computer Science and Game Theory · Computer Science 2023-07-28 Tobias Hecking , Swathy Muthukrishnan , Alexander Weinert

In collaborative goal-oriented settings, the participants are not only interested in achieving a successful outcome, but do also implicitly negotiate the effort they put into the interaction (by adapting to each other). In this work, we…

Computation and Language · Computer Science 2024-03-27 Philipp Sadler , Sherzod Hakimov , David Schlangen

We give operational meaning to wave-particle duality in terms of discrimination games. Duality arises as a constraint on the probability of winning these games. The games are played with the aid of an n-port interferometer, and involve 3…

Quantum Physics · Physics 2018-02-07 Emilio Bagan , John Calsamiglia , Janos A. Bergou , Mark Hillery

Consider a game where Alice generates an integer and Bob wins if he can factor that integer. Traditional game theory tells us that Bob will always win this game even though in practice Alice will win given our usual assumptions about the…

Computer Science and Game Theory · Computer Science 2009-11-18 Lance Fortnow , Rahul Santhanam

Two-player stochastic games are games with two 2 players and a randomised entity called "nature". A natural question to ask in this framework is the existence of strategies that ensure that an event happens with probability 1 (almost-sure…

Computer Science and Game Theory · Computer Science 2018-06-27 Youssouf Oualhadj , Léo Tible , Daniele Varacca

Negative dependence of sequences of random variables is often an interesting characteristic of their distribution, as well as a useful tool for studying various asymptotic results, including central limit theorems, Poisson approximations,…

Probability · Mathematics 2022-08-26 Yaakov Malinovsky , Yosef Rinott

In this paper we solve the three-player-game question. A three-player-game consists of a series of rounds. There are altogether three players. Two players participate in each round, at the end of the round the loser quits and the third…

Probability · Mathematics 2020-09-11 Fangqi Li

We study a modified prisoner's dilemma game taking place on two-dimensional disordered square lattices. The players are pure strategists and can either cooperate or defect with their immediate neighbors. In the generations each player…

Physics and Society · Physics 2007-05-23 Zhi-Xi Wu , Xin-Jian Xu , Zi-Gang Huang , Sheng-Jun Wang , Ying-Hai Wang