Related papers: Elementary submodels, coding strategies, and an in…
Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…
Recent advancements in algorithms for sequential decision-making under imperfect information have shown remarkable success in large games such as limit- and no-limit poker. These algorithms traditionally formalize the games using the…
A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem…
Game theory is used by all behavioral sciences, but its development has long centered around tools for relatively simple games and toy systems, such as the economic interpretation of equilibrium outcomes. Our contribution, compositional…
Categorical quantum mechanics, which examines quantum theory via dagger-compact closed categories, gives satisfying high-level explanations to the quantum information procedures such as Bell-type entanglement or complementary observables…
Stochastic optimal control and games have a wide range of applications, from finance and economics to social sciences, robotics, and energy management. Many real-world applications involve complex models that have driven the development of…
We study the problem of characterizing the set of games that are consistent with observed equilibrium play. Our contribution is to develop and analyze a new methodology based on convex optimization to address this problem for many classes…
A new mathematical model for evolutionary games on graphs is proposed to extend the classical replicator equation to finite populations of players organized on a network with generic topology. Classical results from game theory,…
Subtraction games are a class of impartial combinatorial games whose positions correspond to nonnegative integers and whose moves correspond to subtracting one of a fixed set of numbers from the current position. Though they are easy to…
Two-player games on graphs provide the mathematical foundation for the study of reactive systems. In the quantitative framework, an objective assigns a value to every play, and the goal of player 1 is to minimize the value of the objective.…
The ``losing positions" of certain combinatorial games constitute linear error detecting and correcting codes. We show that a large class of games that can be cast in the form of *annihilation games*, provides a potentially polynomial…
The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments…
We study the value of unique games as a graph-theoretic parameter. This is obtained by labeling edges with permutations. We describe the classical value of a game as well as give a necessary and sufficient condition for the existence of an…
We study a generalisation of sabotage games, a model of dynamic network games introduced by van Benthem. The original definition of the game is inherently finite and therefore does not allow one to model infinite processes. We propose an…
A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding…
Game theory is appropriate for studying cyber conflict because it allows for an intelligent and goal-driven adversary. Applications of game theory have led to a number of results regarding optimal attack and defense strategies. However, the…
We introduce the game of Cat Herding, where an omnipresent herder slowly cuts down a graph until an evasive cat player has nowhere to go. The number of cuts made is the score of a game, and we study the score under optimal play. In this…
The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others' initial locations, but can only communicate if they are on the…
Reachability games are two-player games played on a graph, where the objective of $\texttt{REACH}$ player is to reach the target set whereas the objective of $\texttt{SAFE}$ player is to stay away from the target set. Reachability games…
We study tensor norms over Banach spaces and their relations to quantum information theory, in particular their connection with two-prover games. We consider a version of the Hilbertian tensor norm $\gamma_2$ and its dual $\gamma_2^*$ that…