English
Related papers

Related papers: Polynomial representation of TU-games

200 papers

Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games (that can be seen as a refinement of the well-studied mean-payoff games) are the variant where the payoff of a play is computed as the…

Computer Science and Game Theory · Computer Science 2015-07-15 Thomas Brihaye , Gilles Geeraerts , Axel Haddad , Benjamin Monmege

We study a game first introduced by Martin (actually we use a slight variation of this game) which plays a role for measure analogous to the Banach-Mazur game for category. We first present proofs for the basic connections between this game…

Logic · Mathematics 2019-10-25 Logan Crone , Lior Fishman , Stephen Jackson , Houston Schuerger , David Simmons

Arithmetic functions in Number Theory meet the Sprague-Grundy function from Combinatorial Game Theory. We study a variety of 2-player games induced by standard arithmetic functions, such as Euclidian division, divisors, remainders and…

Number Theory · Mathematics 2021-07-06 Douglas E. Iannucci , Urban Larsson

Cooperative 2-matching games are a generalization of cooperative matching games, where the value function is given by maximum-weight b-matchings, for a vertex capacity vector $b \leq 2$. We show how to separate over the core of 2-matching…

Computer Science and Game Theory · Computer Science 2025-02-12 Laura Sanità , Lucy Verberk

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

Modern applications require robots to comply with multiple, often conflicting rules and to interact with the other agents. We present Posetal Games as a class of games in which each player expresses a preference over the outcomes via a…

The sequential equilibrium is a standard solution concept for extensive-form games with imperfect information that includes an explicit representation of the players' beliefs. An assessment consisting of a strategy and a belief is a…

Computer Science and Game Theory · Computer Science 2024-02-08 Moritz Graf , Thorsten Engesser , Bernhard Nebel

This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and…

Computer Science and Game Theory · Computer Science 2016-02-16 Sascha Kurz , Xavier Molinero , Martin Olsen , Maria Serna

We study the geometric structure of the set of cooperative transferable utility games having a nonempty core, characterized by Bondareva and Shapley as balanced games. We show that this set is a nonpointed polyhedral cone, and we find the…

Combinatorics · Mathematics 2025-01-27 Pedro Garcia-Segador , Michel Grabisch , Pedro Miranda

We introduce the Pythagorean dimension: a natural number (or infinity) for all representations of the Cuntz algebra and certain unitary representations of the Richard Thompson groups called Pythagorean. For each natural number d we…

Operator Algebras · Mathematics 2024-08-06 Arnaud Brothier , Dilshan Wijesena

Fuzzy Set Theory has been applied in many fields such as Operations Research, Control Theory, and Management Sciences etc. In particular, an application of this theory in Managerial Decision Making Problems has a remarkable significance. In…

Artificial Intelligence · Computer Science 2013-07-09 Arindam Chaudhuri

For a finite set $V\subset \mathbb{R}^n$, a set $T\subset \mathbb{R}^n$ is called $V$-closed if $t \in T$ and $v\in V$ imply that either $t+v\in T$ or $t-v \in T$. The set $P(V):=\{\sum_{v \in W} v: W \subset V\}$ is clearly $V$-closed and…

Combinatorics · Mathematics 2025-12-04 Imre Bárány , Jeck Lim

We introduce perfect half space games, in which the goal of Player 2 is to make the sums of encountered multi-dimensional weights diverge in a direction which is consistent with a chosen sequence of perfect half spaces (chosen dynamically…

Computer Science and Game Theory · Computer Science 2019-08-20 Thomas Colcombet , Marcin Jurdziński , Ranko Lazić , Sylvain Schmitz

We address an open problem on the computability of correlated equilibria in a variant of polymatrix where each player's utility is the maximum of their edge payoffs. We demonstrate that this max-variant game has the polynomial expectation…

Computer Science and Game Theory · Computer Science 2025-11-03 Howard Dai

We study mean field games with unbounded coefficients. The existence of a solution is proved. We propose a new approach based on Fokker-Planck-Kolmogorov equations, the Ambrosio-Figalli-Trevisan superposition principle, the method of…

Analysis of PDEs · Mathematics 2026-03-02 Stanislav V. Shaposhnikov , Dmitry V. Shatilovich

Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…

General Topology · Mathematics 2025-11-11 Matheus Duzi , Paul Szeptycki , Walter Tholen

We prove a theorem computing the number of solutions to a system of equations which is generic subject to the sparsity conditions embodied in a graph. We apply this theorem to games obeying graphical models and to extensive-form games. We…

Commutative Algebra · Mathematics 2007-05-23 Ruchira S. Datta

We propose a parametric family of measures of fairness in allocations of TU-cooperative games. Their definition is based on generalized Renyi Entropy, is related to the Cowell-Kuga generalized entropy indices in welfare economics, and aims…

Computer Science and Game Theory · Computer Science 2012-08-02 Cosmin Bonchis , Gabriel Istrate

We announce misere-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misere quotients--commutative monoids that encode the additive structure of specific misere-play games. We also…

Combinatorics · Mathematics 2008-06-30 Thane E. Plambeck , Aaron N. Siegel

For an arbitrary category, we consider the least class of functors con- taining the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of…

Logic in Computer Science · Computer Science 2016-10-21 Luigi Santocanale