Related papers: The Compulsive Gambler Process
Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Agents are modeled as points, and each of them is equipped with a compass. Compasses of agents may be…
The concept of intransitiveness for games, which is the condition for which there is no first-player winning strategy can arise surprisingly, as happens in the Penney game, an extension of the heads or tails. Since a game can be converted…
In this paper we extend the framework of evolutionary inspection game put forward recently by the author and coworkers to a large class of conflict interactions dealing with the pressure executed by the major player (or principal) on the…
We study the set of (stationary) feasible payoffs of overlapping generation repeated games that can be achieved by action sequences in which every generation of players plays the same sequence of action profiles. First, we completely…
We consider 2-player zero-sum stochastic games where each player controls his own state variable living in a compact metric space. The terminology comes from gambling problems where the state of a player represents its wealth in a casino.…
The study of the number of collisions in a Poisson-Dirichlet coalescent leads to the analysis of the following version of a stochastic leader-elec\-tion algorithm. Consider an infinite family of persons, labeled by $1,2,3,\ldots$, who…
We document a mechanism operating in complex adaptive systems leading to dynamical pockets of predictability (``prediction days''), in which agents collectively take predetermined courses of action, transiently decoupled from past history.…
Zero-sum Dynkin games under Poisson constraints, where players can only stop at the event times of a Poisson process, have been studied widely in the recent literature. The constraint can be modelled in two ways: either both players share…
In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). The winner is the first one to claim all the edges of some…
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…
We present a novel reshuffling exchange model and investigate its long time behavior. In this model, two individuals are picked randomly, and their wealth $X_i$ and $X_j$ are redistributed by flipping a sequence of fair coins leading to a…
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…
We study adaptive learning in a typical p-player game. The payoffs of the games are randomly generated and then held fixed. The strategies of the players evolve through time as the players learn. The trajectories in the strategy space…
We introduce a general framework for continuous-time betting markets, in which a bookmaker can dynamically control the prices of bets on outcomes of random events. In turn, the prices set by the bookmaker affect the rate or intensity of…
The greedy walk is a walk on a point process that always moves from its current position to the nearest not yet visited point. We consider here various point processes on two lines. We look first at the greedy walk on two independent…
This paper treats a random collision model of three species, which is represented by the random time change of three standard Poisson processes. The prey-predator relation in the random collision model looks like paper-scissors-stone game,…
Temporal graphs are a popular modelling mechanism for dynamic complex systems that extend ordinary graphs with discrete time. Simply put, time progresses one unit per step and the availability of edges can change with time. We consider the…
In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a…
In this work the properties of minority games containing agents which try to winning all the time are studied by means of computational simulations. We have considered several ways of introducing above the rules clever players using…
We construct games of chance from simpler games of chance. We show that it may happen that the simpler games of chance are fair or unfavourable to a player andyet the new combined game is favourable -- this is a counter-intuitive…