Related papers: A Phase Transition in Minesweeper
Concavity and its refinements underpin tractability in multiplayer games, where players independently choose actions to maximize their own payoffs which depend on other players' actions. In concave games, where players' strategy sets are…
The Traveling Salesperson problem asks for the shortest cyclic tour visiting a set of cities given their pairwise distances and belongs to the NP-hard complexity class, which means that with all known algorithms in the worst case instances…
We investigate the nature of quantum phase transitions in a (1+1)-dimensional field theory composed of $N$ copies of the Ising conformal field theory interacting via competing relevant perturbations. The field theory governs the competition…
This project investigates the potential of computers to solve complex tasks such as games. The paper proves that the complexity of a generalized version of spider solitaire is NP-Complete and uses much of structure of the proof that…
The effects of payoffs and noise on the maintenance of cooperative behavior are studied in an evolutionary Prisoner's Dilemma game with players located on the sites of different two-dimensional lattices. This system exhibits a phase…
We classify phases of a bosonic lattice model based on the computational complexity of classically simulating the system. We show that the system transitions from being classically simulable to classically hard to simulate as it evolves in…
The matrix scaling problem, particularly the Sinkhorn-Knopp algorithm, has been studied for over 60 years. In practice, the algorithm often yields high-quality approximations within just a few iterations. Theoretically, however, the…
We consider learnability transitions in monitored quantum systems that undergo noisy evolution, subject to a global strong symmetry -- i.e., in addition to the measuring apparatus, the system can interact with an unobserved environment, but…
Phase transitions in many complex combinational problems have been widely studied in the past decade. In this paper, we investigate phase transitions in the knowledge compilation empirically, where DFA, OBDD and d-DNNF are chosen as the…
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballot and use a voting rule to decide the winning action(s).…
We show that the maximum success probability of players sharing quantum entanglement in a two-player game with classical questions of logarithmic length and classical answers of constant length is NP-hard to approximate to within constant…
Repulsive point processes arise in models where competition forces entities to be more spread apart than if placed independently. Simulation of these types of processes can be accomplished using dominated coupling from the past with a…
The phase diagram of a system of monodispersed hard rectangles of size $m\times m k$ on a square lattice is numerically determined for $m=2,3$ and aspect ratio $k= 1,2,\ldots, 7$. We show the existence of a disordered phase, a nematic phase…
Adversarial SAT (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity…
Random constraint satisfaction problems play an important role in computer science and combinatorics. For example, they provide challenging benchmark instances for algorithms and they have been harnessed in probabilistic constructions of…
For random CNF formulae with m clauses, n variables and an unrestricted number of literals per clause the transition from high to low satisfiability can be determined exactly for large n. The critical density m/n turns out to be strongly…
Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…
Phase transitions in spin glass type systems and, more recently, in related computational problems have gained broad interest in disparate arenas. In the current work, we focus on the "community detection" problem when cast in terms of a…
We study the complexity of a particular class of board games, which we call `slide and merge' games. Namely, we consider 2048 and Threes, which are among the most popular games of their type. In both games, the player is required to slide…
In this paper, we use a model of large random network game where the agents plays selfishly and are affected by their neighbors, to explore the conditions under which the Nash equilibrium (NE) of the game is affected by a perturbation in…