Related papers: Late comment on Astumian's paradox
Parrondo's paradox refers to the counter-intuitive situation where a winning strategy results from a suitable combination of losing ones. Simple stochastic games exhibiting this paradox have been introduced around the turn of the…
We recently introduced p-automata, automata that read discrete-time Markov chains. We used turn-based stochastic parity games to define acceptance of Markov chains by a subclass of p-automata. Definition of acceptance required a cumbersome…
We consider static finite-player network games and their continuum analogs, graphon games. Existence and uniqueness results are provided, as well as convergence of the finite-player network game optimal strategy profiles to their analogs…
We consider continuous-space, discrete-time Markov chains on $\mathbb{R}^d$, that admit a finite number $N$ of metastable states. Our main motivation for investigating these processes is to analyse random Poincar\'e maps, which describe…
Logit Dynamics [Blume, Games and Economic Behavior, 1993] are randomized best response dynamics for strategic games: at every time step a player is selected uniformly at random and she chooses a new strategy according to a probability…
The solution of parity games over pushdown graphs (Walukiewicz '96) was the first step towards an effective theory of infinite-state games. It was shown that winning strategies for pushdown games can be implemented again as pushdown…
We analyze a class of stochastic dynamic games among teams with asymmetric information, where members of a team share their observations internally with a delay of $d$. Each team is associated with a controlled Markov Chain, whose dynamics…
If the state space of a homogeneous continuous-time Markov chain is too large, making inferences - here limited to determining marginal or limit expectations - becomes computationally infeasible. Fortunately, the state space of such a chain…
This short note is devoted to the unraveling of the hidden interactivity of ordinary games which is an artefact of predictions of the behaviour of other players by the fixed player and describes deviations of their real behaviour from such…
The Parrondo effect describes the seemingly paradoxical situation in which two losing games can, when combined, become winning [Phys. Rev. Lett. 85, 24 (2000)]. Here we generalize this analysis to the case where both games are…
This work considers stochastic differential games with a large number of players, whose costs and dynamics interact through the empirical distribution of both their states and their controls. We develop a new framework to prove convergence…
Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by J.~M.~R.~Parrondo, that two losing games $A$ and $B$ can produce an winning outcome has been adapted in many physical and biological…
Assume that letters (from a finite alphabet) in a text form a Markov chain. We track two distinct words, $U$ and $D$. A gambler gains 1 point for each occurrence of $U$ (including overlapping occurrences) and loses 1 point for each…
We study an ensemble of individuals playing the two games of the so-called Parrondo paradox. In our study, players are allowed to choose the game to be played by the whole ensemble in each turn. The choice cannot conform to the preferences…
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.…
Motivated by techniques developed in recent progress on lower bounds for sublinear time algorithms (Behnezhad, Roghani and Rubinstein, STOC 2023, FOCS 2023, and STOC 2024) we introduce and study a new class of randomized algorithmic…
In this paper, we analyze linear-quadratic stochastic differential games with a continuum of players interacting through graphon aggregates, each state being subject to idiosyncratic Brownian shocks. The major technical issue is the joint…
In this letter we announce rigorous results that elucidate the relation between metastable states and low-lying eigenvalues in Markov chains in a much more general setting and with considerable greater precision as was so far available.…
We analyze the dynamics of a spin 1/2 subsystem coupled to a spin chain. We simulate numerically the full quantum many-body system for various sets of parameters and initial states of the chain, and characterize the divisibility of the…
We construct and study the transition probability matrix of evolutionary games in which the number of players is finite (and relatively small) of such games. We use a simplified version of the population games studied by Sandholm. After…