Related papers: Game arguments in computability theory and algorit…

It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We…

Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of…

Game Logic is an excellent setting to study proofs-about-programs via the interpretation of those proofs as programs, because constructive proofs for games correspond to effective winning strategies to follow in response to the opponent's…

Imitation is simple behavior which uses successful actions of others in order to deal with one's own problems. Because success of imitation generally depends on whether profit of an imitating agent coincides with those of other agents or…

Game semantics is a rich and successful class of denotational models for programming languages. Most game models feature a rather intuitive setup, yet surprisingly difficult proofs of such basic results as associativity of composition of…

We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely…

Recent successes of game-theoretic formulations in ML have caused a resurgence of research interest in differentiable games. Overwhelmingly, that research focuses on methods and upper bounds on their speed of convergence. In this work, we…

This paper uses category theory to develop an entirely new approach to approximate game theory. Game theory is the study of how different agents within a multi-agent system take decisions. At its core, game theory asks what an optimal…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical rationality notion in game theory. In many classes of games this is justified by results showing that any strategy is admissible or dominated by…

Estimating discrete games of complete information is often computationally difficult due to partial identification and the absence of closed-form moment characterizations. This paper proposes computationally tractable approaches to…

Coding theory revolves around the incorporation of redundancy into transmitted symbols, computation tasks, and stored data to guard against adversarial manipulation. However, error correction in coding theory is contingent upon a strict…

Covering spaces of graphs have long been useful for studying expanders (as "graph lifts") and unique games (as the "label-extended graph"). In this paper we advocate for the thesis that there is a much deeper relationship between…

In 1901, Bouton proved that a winning strategy of the game of Nim is given by the bitwise XOR, called the nim-sum. But, why does such a weird binary operation work? Led by this question, this paper introduces a categorical reinterpretation…

We extend anytime constraints to the Markov game setting and the corresponding solution concept of an anytime-constrained equilibrium (ACE). Then, we present a comprehensive theory of anytime-constrained equilibria that includes (1) a…

We characterize winning strategies in various infinite games involving filters on the natural numbers in terms of combinatorics or structural properties of the given filter. These generalize several ultrafilter games of Galvin.

LP-duality theory has played a central role in the study of the core, right from its early days to the present time. However, despite the extensive nature of this work, basic gaps still remain. We address these gaps using the following…

Game theory is the standard tool used to model strategic interactions in evolutionary biology and social science. Traditional game theory studies the equilibria of simple games. But is traditional game theory applicable if the game is…

We present an analog of O'Neill's Theorem (Theorem 5.2 in [17]) for finite games, which reveals some of the structure of equilibria under payoff perturbations in finite games.

Game Theory concepts have been successfully applied in a wide variety of domains over the past decade. Sports and games are one of the popular areas of game theory application owing to its merits and benefits in solving complex scenarios.…