Related papers: A Phase Transition in Minesweeper
Leadership games provide a powerful paradigm to model many real-world settings. Most literature focuses on games with a single follower who acts optimistically, breaking ties in favour of the leader. Unfortunately, for real-world…
We study an open-chain totally asymmetric exclusion process (TASEP) with stochastic gates present at the two boundaries. The gating dynamics has been modeled keeping the physical system of ion-channel gating in mind. These gates can…
Mean-payoff games play a central role in quantitative synthesis and verification. In a single-dimensional game a weight is assigned to every transition and the objective of the protagonist is to assure a non-negative limit-average weight.…
Forcing finite state mean field games by a relevant form of common noise is a subtle issue, which has been addressed only recently. Among others, one possible way is to subject the simplex valued dynamics of an equilibrium by a so-called…
In this paper we provide a case study of the use of relatively sophisticated mathematics and algorithms to redefine and adapt a simple traditional game/puzzle to exploit the computational power of smart devices. The focus here is not so…
The ground state properties of spin-1/2 ladders are studied, emphasizing the role of frustration and ring exchange coupling. We present a unified field theory for ladders with general coupling constants and geometry. Rich phase diagrams can…
Quantum games with incomplete information can be studied within a Bayesian framework. We consider a version of prisoner's dilemma (PD) in this framework with three players and characterize the Nash equilibria. A variation of the standard PD…
Spin-crossover has a wide range of applications from memory devices to sensors. This has to do mainly with the nature of the transition, which may be abrupt, gradual or incomplete and may also present hysteresis. This transition alters the…
The emergence of mutual cooperation is studied in a spatially extended evolutionary prisoner's dilemma game in which the players are located on the sites of cubic lattices for dimensions d=1, 2, and 3. Each player can choose one of the…
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea''…
In this paper we propose a new type of random CSP model, called Model RB, which is a revision to the standard Model B. It is proved that phase transitions from a region where almost all problems are satisfiable to a region where almost all…
We analyze the crossing of a quantum critical point based on exact results for the transverse XY model. In dependence of the change rate of the driving field, the evolution of the ground state is studied while the transverse magnetic field…
We investigate quantum phase transitions in the frustrated orthogonal-dimer chain with an arbitrary spin $S \geq 1/2$. When the ratio of the competing exchange couplings is varied, first-order phase transitions occur 2S times among distinct…
A mixture of hard squares, dimers and vacancies on a square lattice is known to undergo a transition from a low-density disordered phase to high-density columnar ordered phase. Along the fully packed square-dimer line, the system undergoes…
Implementing multi-player networked games by broadcasting the player's input and letting each client calculate the game state - a scheme known as lock-step simulation - is an established technique. However, ensuring that every client in…
Spin ladders are key models that act as intermediaries between one-dimensional and two-dimensional spin systems. In this study, we examine a coupled spin-$1/2$ ladder, where frustrated ladders with leg, rung, and diagonal interactions are…
We consider turn-based stochastic two-player games with a combination of a parity condition that must hold surely, that is in all possible outcomes, and of a parity condition that must hold almost-surely, that is with probability 1. The…
A common assumption employed in most previous works on evolutionary game dynamics is that every individual player has full knowledge about and full access to the complete set of available strategies. In realistic social, economical, and…
We analyse the complexity of the satisfiability problem ssmSAT for State Space Models (SSM), which asks whether an input sequence can lead the model to an accepting configuration. We find that ssmSAT is undecidable in general, reflecting…
We introduce a simple class of mean field games with absorbing boundary over a finite time horizon. In the corresponding $N$-player games, the evolution of players' states is described by a system of weakly interacting It\^o equations with…