Related papers: A Complexity of double dummy bridge
We compute the complexity of the billiard language of the regular Euclidean $N$-gons (and other families of rational lattice polygons), answering a question posed by Cassaigne-Hubert-Troubetzkoy. Our key technical result is a counting…
This paper studies the dimer model on the dual graph of the square-octagon lattice, which can be viewed as the domino tilings with impurities in some sense. In particular, under a certain boundary condition, we give an exact formula…
We study a martingale Schr\"odinger bridge problem: given two probability distributions, find their martingale coupling with minimal relative entropy. Our main result provides Schr\"odinger potentials for this coupling. Namely, under…
Given any closed, connected, orientable $3$--manifold and integers $g\geq g(M), D > 0$, we show the existence of knots in $M$ whose genus $g$ bridge number is greater than $D$. These knots lie in a page of an open book decomposition of $M$,…
In this paper we introduce a new approach for the study of the complex behavior of Minority Game using the tools of algorithmic complexity, physical entropy and information theory. We show that physical complexity and mutual information…
We analyze Solo Chess puzzles, where the input is an $n \times n$ board containing some standard Chess pieces of the same color, and the goal is to make a sequence of capture moves to reduce down to a single piece. Prior work analyzes this…
Unlike Poker where the action space $\mathcal{A}$ is discrete, differential games in the physical world often have continuous action spaces not amenable to discrete abstraction, rendering no-regret algorithms with…
In the classical Binary Networked Public Goods (BNPG) game, a player can either invest in a public project or decide not to invest. Based on the decisions of all the players, each player receives a reward as per his/her utility function.…
Difficulty is one of the key drivers of player engagement and it is often one of the aspects that designers tweak most to optimise the player experience; operationalising it is, therefore, a crucial task for game development studios. A…
This paper provides a complexity analysis for the game of reconnaissance blind chess (RBC), a recently-introduced variant of chess where each player does not know the positions of the opponent's pieces a priori but may reveal a subset of…
This paper explores a novel way for analyzing the tournament structures to find a best suitable one for the tournament under consideration. It concerns about three aspects such as tournament conducting cost, competitiveness development and…
In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation problem is complete for logarithmic space or NC$^1$,…
We analyze the trade-off between model complexity and accuracy for random forests by breaking the trees up into individual classification rules and selecting a subset of them. We show experimentally that already a few rules are sufficient…
The aim of this paper is twofold. First, we extend the results of [33] concerning the existence and uniqueness of second-order reflected 2BSDEs to the case of two obstacles. Under some regularity assumptions on one of the barriers, similar…
Whenever a distinct state is immersed in a sea of complicated and dense states, the strength of the distinct state, which we refer to as a doorway, is distributed in their neighboring states. We analyze this mechanism for 2-D billiards with…
The double interdiction problem on trees (DIT) for the sum of root-leaf distances (SRD) has significant implications in diverse areas such as transportation networks, military strategies, and counter-terrorism efforts. It aims to maximize…
A sliding puzzle is a combination puzzle where a player slide pieces along certain routes on a board to reach a certain end-configuration. In this paper, we propose a novel measurement of complexity of massive sliding puzzles with…
This paper studies the complexity of solving two classes of non-cooperative games in a distributed manner in which the players communicate with a set of system nodes over noisy communication channels. The complexity of solving each game…
We consider the circuit complexity of free bosons, or equivalently free fermions, in 1+1 dimensions. Motivated by the results of [1] and [2, 3] who found different behavior in the complexity of free bosons and fermions, in any dimension, we…
Game-theoretic approaches are envisioned to bring human-like reasoning skills and decision-making processes for autonomous vehicles (AVs). However, challenges including game complexity and incomplete information still remain to be addressed…