Related papers: Two-Person Additively-Separable Sum Games

With increasing game size, a problem of computational complexity arises. This is especially true in real world problems such as in social systems, where there is a significant population of players involved in the game, and the complexity…

Subtraction games have a rich literature as normal-play combinatorial games (e.g., Berlekamp, Conway, and Guy, 1982). Recently, the theory has been extended to zero-sum scoring play (Cohensius et al. 2019). Here, we take the approach of…

We analyze, both analytically and numerically, the self-organization of a system of "selfish" adaptive agents playing an arbitrary iterated pairwise game (defined by a 2X2 payoff matrix). Examples of possible games to play are: the…

Artificial intelligence and robotic competitions are accompanied by a class of game paradigms in which each player privately commits a strategy to a game system which simulates the game using the collected joint strategy and then returns…

Direct reciprocity is a mechanism for sustaining mutual cooperation in repeated social dilemma games, where a player would keep cooperation to avoid being retaliated by a co-player in the future. So-called zero-determinant (ZD) strategies…

We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…

Two-player games on graphs is central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can…

Iterated coopetitive games capture the situation when one must efficiently balance between cooperation and competition with the other agents over time in order to win the game (e.g., to become the player with highest total utility).…

We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…

This paper introduces a novel algorithm for two-player deterministic games with perfect information, which we call PROBS (Predict Results of Beam Search). Unlike existing methods that predominantly rely on Monte Carlo Tree Search (MCTS) for…

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

We extend the optimin notion of Ismail (2025) from mixed strategy profiles to correlated distributions. A correlated distribution is evaluated by the worst expected payoff each player can receive when opponents may either obey their private…

This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in discounted repeated games. The process starts with a single hypercube approximation of the set of SPE. Then the initial…

Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…

The paper [Ras15a] introduced distribution-valued games. This game-theoretic model uses probability distributions as payoffs for games in order to express uncertainty about the payoffs. The player's preferences for different payoffs are…

We propose a logical framework combining a game-theoretic study of abilities of agents to achieve quantitative objectives in multi-player games by optimizing payoffs or preferences on outcomes with a logical analysis of the abilities of…

Contemporary applications of machine learning in two-team e-sports and the superior expressivity of multi-agent generative adversarial networks raise important and overlooked theoretical questions regarding optimization in two-team games.…

This paper introduces an explicit algorithm for computing perfect public equilibrium (PPE) payoffs in repeated games with imperfect public monitoring, public randomization, and discounting. The method adapts the established framework by…

Synchronous linear constraint system games are nonlocal games that verify whether or not two players share a solution to a given system of equations. Two algebraic objects associated to these games encode information about the existence of…

We prove that every repeated game with countably many players, finite action sets, and tail-measurable payoffs admits an $\epsilon$-equilibrium, for every $\epsilon > 0$.