Related papers: A Note on Computational Complexity of Dou Shou Qi

This paper considers the problem of solving infinite two-player games over finite graphs under various classes of progress assumptions motivated by applications in cyber-physical system (CPS) design. Formally, we consider a game graph G, a…

This paper is dealing with another multiple person game model under the antagonistic duel type setup. The most flexible multiple person duel game is analytically solved and the explicit formulas are solved to determine the time dependent…

The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal…

Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the accumulated weight while reaching a target. Weighted timed games are notoriously difficult and…

We analyze the computational complexity of two 2-player games involving packing objects into a box. In the first game, players alternate drawing polycubes from a shared pile and placing them into an initially empty box in any available…

In this paper, we study two-player zero-sum turn-based games played on a finite multidimensional weighted graph. In recent papers all dimensions use the same measure, whereas here we allow to combine different measures. Such heterogeneous…

We study lower bounds on the query complexity of determining correlated equilibrium. In particular, we consider a query model in which an n-player game is specified via a black box that returns players' utilities at pure action profiles. In…

In this thesis, we survey techniques and results from the study of Complexity Theory and Games. We then apply these techniques to obtain new results for previously unstudied games. Our contributions in the games Hexiom, Cut the Rope, and…

We examine the classical contents of quantum games. It is shown that a quantum strategy can be interpreted as a classical strategies with effective density-dependent game matrices composed of transposed matrix elements. In particular,…

In this paper, we study the cooperative card game, The Crew: The Quest for Planet Nine from the viewpoint of algorithmic combinatorial game theory. The Crew: The Quest for Planet Nine, is a game based on traditional trick-taking card games,…

We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…

Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced in arXiv:1307.2145, arXiv:1403.4958. We initiate the study of games for this model. We study coalition problems: can a given…

A $\mathrm{CHSH}_{q}$ game is a generalization of the standard two player $\mathrm{CHSH}$ game, having $q$ different input and output options. In contrast to the binary game, the best classical and quantum winning strategies are not known…

We study the computational complexity of an important property of simple, regular and weighted games, which is decisiveness. We show that this concept can naturally be represented in the context of hypergraph theory, and that decisiveness…

Extensive games are tools largely used in economics to describe decision processes ofa community of agents. In this paper we propose a formal presentation based on theproof assistant COQ which focuses mostly on infinite extensive games and…

We study two-player concurrent stochastic games on finite graphs, with B\"uchi and co-B\"uchi objectives. The goal of the first player is to maximize the probability of satisfying the given objective. Following Martin's determinacy theorem…

We introduce the concept of budget games. Players choose a set of tasks and each task has a certain demand on every resource in the game. Each resource has a budget. If the budget is not enough to satisfy the sum of all demands, it has to…

We introduce a class of extensive form games where players might not be able to foresee the possible consequences of their decisions and form a model of their opponents which they exploit to achieve a more profitable outcome. We improve…

We study the computational complexity of computing or approximating a quasi-proper equilibrium for a given finite extensive form game of perfect recall. We show that the task of computing a symbolic quasi-proper equilibrium is…

Sequential equilibrium is the conventional approach for analyzing multi-stage games of incomplete information. It relies on mutual consistency of beliefs. To relax mutual consistency, I theoretically and experimentally explore the dynamic…