Related papers: A Complexity of double dummy bridge
We provide a weakly exponential complexity upper bound for typical triangular billiards
We study the structural complexity of bimatrix games, formalized via rank, from an empirical perspective. We consider a setting where we have data on player behavior in diverse strategic situations, but where we do not observe the relevant…
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
We study the experimentation dynamics of a decision maker (DM) in a two-armed bandit setup (Bolton and Harris (1999)), where the agent holds ambiguous beliefs regarding the distribution of the return process of one arm and is certain about…
The history of the geometry of Double Field Theory is the history of string theorists' effort to tame higher geometric structures. In this spirit, the first part of this paper will contain a brief overview on the literature of geometry of…
We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…
The power of symbolic computation, as opposed to mere numerical computation, is illustrated with efficient algorithms for studying the generalized gambler's ruin problem in one and two dimensions. We also consider a new generalization of…
We analyse the transport phenomena of 2D quantum billiards with convex boundary of different shape. The quantum mechanical analysis is performed by means of the poles of the S-matrix while the classical analysis is based on the motion of a…
The theory of $p$-modulus provides a general framework for quantifying the richness of a family of objects on a graph. When applied to the family of spanning trees, $p$-modulus has an interesting probabilistic interpretation. In particular,…
Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as…
We consider outer billiard outside regular convex polygons. We deal with the case of regular polygons with $\{3,4,5,6,10\}$ sides, and we describe the symbolic dynamics of the map and compute the complexity of the language.
We analyze the computational complexity of the popular computer games Threes!, 1024!, 2048 and many of their variants. For most known versions expanded to an m x n board, we show that it is NP-hard to decide whether a given starting…
We consider a variation on Maker-Breaker games on graphs or digraphs where the edges have random costs. We assume that Maker wishes to choose the edges of a spanning tree, but wishes to minimise his cost. Meanwhile Breaker wants to make…
We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement…
Recent investigations involving the decay of unstable D-branes in string theory suggest that the tree level open string theory which describes the dynamics of the D-brane already knows about the closed string states produced in the decay of…
Some of the subtleties of the integrability of the elliptic quantum billiard are discussed. A well known classical constant of the motion has in the quantum case an ill-defined commutator with the Hamiltonian. It is shown how this problem…
The complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs, such as the Higman-Sims graph, are graphs of maximal complexity among all graphs of the…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
The aim of this work is to put together two novel concepts from the theory of integrable billiards: billiard ordered games and confocal billiard books. Billiard books appeared recently in the work of Fomenko's school, in particular of V.…