English
Related papers

Related papers: String diagrams for game theory

200 papers

Following our recent development of a compositional model checking algorithm for Markov decision processes, we present a compositional framework for solving mean payoff games (MPGs). The framework is derived from category theory,…

Logic in Computer Science · Computer Science 2023-07-18 Kazuki Watanabe , Clovis Eberhart , Kazuyuki Asada , Ichiro Hasuo

This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and…

Category Theory · Mathematics 2012-07-31 Peter Selinger

Categories of polymorphic lenses in computer science, and of open games in compositional game theory, have a curious structure that is reminiscent of compact closed categories, but differs in some crucial ways. Specifically they have a…

Category Theory · Mathematics 2017-09-19 Jules Hedges

Learning problems commonly exhibit an interesting feedback mechanism wherein the population data reacts to competing decision makers' actions. This paper formulates a new game theoretic framework for this phenomenon, called "multi-player…

Computer Science and Game Theory · Computer Science 2022-04-08 Adhyyan Narang , Evan Faulkner , Dmitriy Drusvyatskiy , Maryam Fazel , Lillian J. Ratliff

We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most…

Logic in Computer Science · Computer Science 2015-03-20 Dusko Pavlovic

This paper develops the category $\mathbf{NCG}$. Its objects are node-and-choice games, which include essentially all extensive-form games. Its morphisms allow arbitrary transformations of a game's nodes, choices, and players, as well as…

Theoretical Economics · Economics 2020-07-29 Peter A. Streufert

We characterize Nash equilibrium by postulating coherent behavior across varying games. Nash equilibrium is the only solution concept that satisfies the following axioms: (i) strictly dominant actions are played with positive probability,…

Theoretical Economics · Economics 2024-07-02 Florian Brandl , Felix Brandt

The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. In a weakly acyclic game, from any starting state, there is a sequence of better-response moves…

Computer Science and Game Theory · Computer Science 2011-08-11 Alex Fabrikant , Aaron D. Jaggard , Michael Schapira

We study solution concepts for normal-form games. We obtain a characterization of Nash equilibria and logit quantal response equilibria, as well as generalizations capturing non-expected utility. Our axioms reflect that players are…

Theoretical Economics · Economics 2025-09-30 Fedor Sandomirskiy , Po Hyun Sung , Omer Tamuz , Ben Wincelberg

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

Computer Science and Game Theory · Computer Science 2010-04-26 Noah D. Stein , Asuman Ozdaglar , Pablo A. Parrilo

Structured game representations have recently attracted interest as models for multi-agent artificial intelligence scenarios, with rational behavior most commonly characterized by Nash equilibria. This paper presents efficient, exact…

Computer Science and Game Theory · Computer Science 2011-10-27 B. Blum , D. Koller , C. R. Shelton

A categorical framework for modeling and analyzing systems in a broad sense is proposed. These systems should be thought of as `machines' with inputs and outputs, carrying some sort of signal that occurs through some notion of time. Special…

Category Theory · Mathematics 2019-03-18 Patrick Schultz , David I. Spivak , Christina Vasilakopoulou

The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…

Combinatorics · Mathematics 2024-11-05 Bojan Bašić , Paul Ellis , Dana C. Ernst , Danijela Popović , Nándor Sieben

We introduce a new class of population games that we call monotropic; these are games characterized by the presence of a unique globally neutrally stable Nash equilibrium. Monotropic games generalize strictly concave potential games and…

Computer Science and Game Theory · Computer Science 2014-04-22 Ioannis Avramopoulos

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…

Computational Complexity · Computer Science 2024-11-08 Bruce M. Kapron , Koosha Samieefar

We define a model for linear logic based on two well-known ingredients: games and simulations. This model is interesting in the following respect: while it is obvious that the objects interpreting formulas are games and that everything is…

Logic in Computer Science · Computer Science 2009-05-26 Pierre Hyvernat

Game theory provides a general mathematical background to study the effect of pair interactions and evolutionary rules on the macroscopic behavior of multi-player games where players with a finite number of strategies may represent a wide…

Physics and Society · Physics 2016-04-20 Gyorgy Szabo , Istvan Borsos

The recent theory of sequential games and selection functions by Mar- tin Escardo and Paulo Oliva is extended to games in which players move simultaneously. The Nash existence theorem for mixed-strategy equilibria of finite games is…

Logic in Computer Science · Computer Science 2015-06-12 Julian Hedges

Classical results of Decision Theory, and its extension to a multi-agent setting: Game Theory, operate only at the associative level of information; this is, classical decision makers only take into account probabilities of events; we go…

Computer Science and Game Theory · Computer Science 2019-10-16 Mauricio Gonzalez-Soto , Luis E. Sucar , Hugo J. Escalante

We show that contrary to common belief in the DisCoCat community, a monoidal category is all that is needed to define a categorical compositional model of natural language. This relies on a construction which freely adds adjoints to a…

Category Theory · Mathematics 2020-09-16 Antonin Delpeuch