Related papers: Prisoners, Rooms, and Lightswitches
We emphasize the dominance in the Monty Hall problem, both in the classical scenario and its multi-door generalization. This is used to show optimality of the class of always-switching strategies for nonuniform allocation of the prize and…
Quantum game theory is a recently developing field of physical research. In this paper, we investigate quantum games in a systematic way. With the famous instance of the Prisoner's Dilemma, we present the fascinating properties of quantum…
Microscopic strategy update rules play an important role in the evolutionary dynamics of cooperation among interacting agents on complex networks. Many previous related works only consider one \emph{fixed} rule, while in the real world,…
In spatial games players typically alter their strategy by imitating the most successful or one randomly selected neighbor. Since a single neighbor is taken as reference, the information stemming from other neighbors is neglected, which…
We analyze an extended model of the Iterated Prisoner's Dilemma where agents decide to play based on the data from their limited memory or recommendations. The cooperators can decide whether to play with the matched opponent or not. The…
We explore the minimal conditions for sustainable cooperation on a spatially distributed population of memoryless, unconditional strategies (cooperators and defectors) in presence of unbiased, non contingent mobility in the context of the…
The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies $P_k=W_1...W_{k-1}(1-W_k)$, where $(W_k)_{k\in\mn}$ are independent copies of a random variable $W$ taking values in $(0,1)$. Assuming that the…
How attention scarcity effects the outcomes of a game? We present our findings on a version of the Iterated Prisoners Dilemma (IPD) game in which players can accept or refuse to play with their partner. We study the memory size effect on…
A two-dimensional small-world type network, subject to spatial prisoners' dilemma dynamics and containing an influential node defined as a special node with a finite density of directed random links to the other nodes in the network, is…
Complex networks are a great tool for simulating the outcomes of different strategies used within the iterated prisoners' dilemma game. However, because the strategies themselves rely on the connection between nodes, then initial network…
We propose an algorithm to restrict the switching signals of a constrained switched system in order to guarantee its stability, while at the same time attempting to keep the largest possible set of allowed switching signals. Our work is…
We describe here a new concept of one group chasing another, called "group chase and escape", by presenting a simple model. We will show that even a simple model can demonstrate rather rich and complex behavior. In particular, there are…
It has been shown that any 9 by 9 Sudoku puzzle must contain at least 17 clues to have a unique solution. This paper investigates the more specific question: given a particular completed Sudoku grid, what is the minimum number of clues in…
Quantum small-worlds are quantum many-body systems that interpolate between completely ordered (nearest-neighbour, next-to-nearest-neighbour etc.) and completely random interactions. As such, they furnish a novel new laboratory to study…
We present an extensive, systematic study of the Prisoner's Dilemma and Snowdrift games on a square lattice under a synchronous, noiseless imitation dynamics. We show that for both the occupancy of the network and the (random) mobility of…
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…
In this paper, the Optional Prisoner's Dilemma game in a spatial environment, with coevolutionary rules for both the strategy and network links between agents, is studied. Using a Monte Carlo simulation approach, a number of experiments are…
Combination locks are widely used to secure bicycles. We consider a combination lock consisting of adjacent rotating dials with the first nonnegative integers printed on each of them. Assuming that we know the correct combination and we…
Most modern control systems are switched, meaning they have continuous as well as discrete decision variables. Switched systems often have constraints called dwell-time constraints (e.g., cycling constraints in a heat pump) on the switching…
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Scheduling Problem. Determining the computational complexity of…