Related papers: The solution to an open problem for a caching game
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, for the case where the players are restricted to finite-memory strategies. First, we describe a general framework, where…
In zero-sum games, the optimal strategy is well-defined by the Nash equilibrium. However, it is overly conservative when playing against suboptimal opponents and it can not exploit their weaknesses. Limited look-ahead game solving in…
Data mining and knowledge discovery are two important growing research fields in the last two decades due to the abundance of data collected from various sources. The exponentially growing volumes of generated data urge the development of…
We provide a formal definition of depth-limited games together with an accessible and rigorous explanation of the underlying concepts, both of which were previously missing in imperfect-information games. The definition works for an…
In this paper we study a linear pursuit differential game described by an infinite system of first-order differential equations in Hilbert space. The control functions of players are subject to geometric constraints. The pursuer attempts to…
This paper provides a polynomial-time algorithm for solving parity games that runs in $\mathcal{O}(n^{2}\cdot(n + m))$ time-ending a search that has taken decades. Unlike previous attractor-based algorithms, the presented algorithm only…
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear…
The game of Hangman is a classical asymmetric two player game in which one player, the setter, chooses a secret word from a language, that the other player, the guesser, tries to discover through single letter matching queries, answered by…
This paper considers a subspace guarding game in high-dimensional space which consists of a play subspace and a target subspace. Two faster defenders cooperate to protect the target subspace by capturing an attacker which strives to enter…
We consider the Robber Locating Game, where an invisible moving robber tries to evade the pursuit of one or more helicopter cops, who send distance probes from anywhere on the graph. In this paper, we attempt to propose two useful…
Two standard algorithms for approximately solving two-player zero-sum concurrent reachability games are value iteration and strategy iteration. We prove upper and lower bounds of 2^(m^(Theta(N))) on the worst case number of iterations…
The localization game is a two player combinatorial game played on a graph $G=(V,E)$. The cops choose a set of vertices $S_1 \subseteq V$ with $|S_1|=k$. The robber then chooses a vertex $v \in V$ whose location is hidden from the cops, but…
In this paper we introduce novel algorithmic strategies for effciently playing two-player games in which the players have different or identical player roles. In the case of identical roles, the players compete for the same objective (that…
We study a game puzzle that has enjoyed recent popularity among mathematicians, computer scientist, coding theorists and even the mass press. In the game, $n$ players are fitted with randomly assigned colored hats. Individual players can…
In this paper, we present a novel, game-theoretic model of deception in two-player, zero-sum games. Our framework leverages an information asymmetry: one player (the deceiver) has access to accurate payoff information, while the other (the…
This paper proposes a game-theoretic approach to address the problem of optimal sensor placement against an adversary in uncertain networked control systems. The problem is formulated as a zero-sum game with two players, namely a malicious…
In this work, we introduce a new toolkit for analyzing cloning games, a notion that captures stronger and more quantitative versions of the celebrated quantum no-cloning theorem. This framework allows us to analyze a new cloning game based…
This paper considers a game-theoretic formulation of the covert communications problem with finite blocklength, where the transmitter (Alice) can randomly vary her transmit power in different blocks, while the warden (Willie) can randomly…
We formulate a stochastic zero-sum game over continuous-time dynamics to analyze the competition between the attacker, who tries to covertly misguide the vehicle to an unsafe region, versus the detector, who tries to detect the attack…
In the symmetric rendezvous search game played on Kn (the completely connected graph on n vertices) two players are initially placed at two distinct vertices (called locations). The game is played in discrete steps and at each step each…