Related papers: A Phase Transition in Minesweeper
This technical note extends recent results on the computational complexity of globally minimizing the error of piecewise-affine models to the related problem of minimizing the error of switching linear regression models. In particular, we…
Many popular puzzle and matching games have been analyzed through the lens of computational complexity. Prominent examples include Sudoku, Candy Crush, and Flood-It. A common theme among these widely played games is that their generalized…
We study phase diagrams of a class of doped quantum dimer models on the square lattice with ground-state wave functions whose amplitudes have the form of the Gibbs weights of a classical doped dimer model. In this dimer model, parallel…
It is shown how simple assumptions lead to piecewise linear behavior, which is observed in certain phase transitions.
We study the sample complexity of identifying the pure strategy Nash equilibrium (PSNE) in a two-player zero-sum matrix game with noise. Formally, we are given a stochastic model where any learner can sample an entry $(i,j)$ of the input…
Number partitioning is one of the classical NP-hard problems of combinatorial optimization. It has applications in areas like public key encryption and task scheduling. The random version of number partitioning has an "easy-hard" phase…
The Local Search algorithm (or Hill Climbing, or Iterative Improvement) is one of the simplest heuristics to solve the Satisfiability and Max-Satisfiability problems. It is a part of many satisfiability and max-satisfiability solvers, where…
We consider the ground-state properties of the s=1/2 Ising chain in a transverse field which varies regularly along the chain having a period of alternation 2. Such a model, similarly to its uniform counterpart, exhibits quantum phase…
We consider concurrent games played by two-players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study a…
We study the iteration complexity of decentralized learning of approximate correlated equilibria in incomplete information games. On the negative side, we prove that in $\mathit{extensive}$-$\mathit{form}$ $\mathit{games}$, assuming…
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…
Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different…
We investigate the ground states of spin-$S$ Kitaev ladders using exact analytical solutions (for $S = 1/2$), perturbation theory, and the density matrix renormalization group (DMRG) method. We find an even-odd effect: in the case of…
Consider a strongly monotone game where the players' utility functions include a reward function and a linear term for each dimension, with coefficients that are controlled by the manager. Gradient play converges to a unique Nash…
We study the sweep complexity of DFA in one-way jumping mode answering several questions posed earlier. This measure is the number of times in the worst case that such machines have to return to the beginning of their input after having…
The physics-based simulation game Angry Birds has been heavily researched by the AI community over the past five years, and has been the subject of a popular AI competition that is currently held annually as part of a leading AI conference.…
We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and…
We develop and harness a phase field simulation method to study liquid filling on grooved surfaces. We consider both short-range and long-range liquid-solid interactions, with the latter including purely attractive and repulsive…
The phase transition in frustrated spin systems is a fascinated subject in statistical physics. We show the result obtained by the Wang-Landau flat histogram Monte Carlo simulation on the phase transition in the fully frustrated simple…
Recently, a standardized framework was proposed for introducing quantum-inspired moves in mathematical games with perfect information and no chance. The beauty of quantum games-succinct in representation, rich in structures, explosive in…