English
Related papers

Related papers: Games for Pucci's maximal operators

200 papers

This paper considers two-player zero-sum finite-horizon Markov games with simultaneous moves. The study focuses on the challenging settings where the value function or the model is parameterized by general function classes. Provably…

Computer Science and Game Theory · Computer Science 2021-11-02 Baihe Huang , Jason D. Lee , Zhaoran Wang , Zhuoran Yang

Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally…

Optimization and Control · Mathematics 2015-01-05 Jérôme Bolte , Stéphane Gaubert , Guillaume Vigeral

The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…

Optimization and Control · Mathematics 2022-11-30 Nick Dimou

Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms…

Computer Science and Game Theory · Computer Science 2012-02-20 Kristoffer Arnsfelt Hansen , Michal Koucky , Niels Lauritzen , Peter Bro Miltersen , Elias Tsigaridas

We prove the almost equivalence of the minimax theorem and the strong duality theorem for a large class of games and conic programs. The previous fundamental results on the equivalence of linear programming and two-player zero-sum games…

Optimization and Control · Mathematics 2026-04-14 Nikos Dimou

While discounted payoff games and classic games that reduce to them, like parity and mean-payoff games, are symmetric, their solutions are not. We have taken a fresh view on the properties that optimal solutions need to have, and devised a…

Data Structures and Algorithms · Computer Science 2026-03-11 Daniele Dell'Erba , Arthur Dumas , Sven Schewe

Zero-sum and non-zero-sum (aka general-sum) games are relevant in a wide range of applications. While general non-zero-sum games are computationally hard, researchers focus on the special class of monotone games for gradient-based…

Computer Science and Game Theory · Computer Science 2025-12-03 Ruichen Luo , Sebastian U. Stich , Krishnendu Chatterjee

We study the value of a two-player zero-sum game on a random matrix $M\in \mathbb{R}^{n\times m}$, defined by $v(M) = \min_{x\in\Delta_n}\max_{y\in \Delta_m}x^T M y$. In the setting where $n=m$ and $M$ has i.i.d. standard Gaussian entries,…

Probability · Mathematics 2026-01-13 Romain Cosson , Laurent Massoulié

In this paper, we introduce an abstract fuzzy economy (generalized fuzzy game) model with a countable space of actions and we study the existence of the fuzzy equilibrium. As applications, two types of results are obtained. The first ones…

Optimization and Control · Mathematics 2013-06-25 Monica Patriche

We propose a new framework of Markov $\alpha$-potential games to study Markov games. We show that any Markov game with finite-state and finite-action is a Markov $\alpha$-potential game, and establish the existence of an associated…

Computer Science and Game Theory · Computer Science 2025-04-02 Xin Guo , Xinyu Li , Chinmay Maheshwari , Shankar Sastry , Manxi Wu

Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the…

Logic in Computer Science · Computer Science 2016-04-18 Vojtěch Forejt , Marta Kwiatkowska , Gethin Norman , Ashutosh Trivedi

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

We propose the first loss function for approximate Nash equilibria of normal-form games that is amenable to unbiased Monte Carlo estimation. This construction allows us to deploy standard non-convex stochastic optimization techniques for…

Computer Science and Game Theory · Computer Science 2024-04-16 Ian Gemp , Luke Marris , Georgios Piliouras

This paper examines multiplayer symmetric constant-sum games with more than two players in a competitive setting, including examples like Mahjong, Poker, and various board and video games. In contrast to two-player zero-sum games,…

Machine Learning · Computer Science 2024-10-04 Jiawei Ge , Yuanhao Wang , Wenzhe Li , Chi Jin

We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety…

Computer Science and Game Theory · Computer Science 2008-09-25 Krishnendu Chatterjee , Luca de Alfaro , Thomas A. Henzinger

We propose a framework to compute approximate Nash equilibria in integer programming games with nonlinear payoffs, i.e., simultaneous and non-cooperative games where each player solves a parametrized mixed-integer nonlinear program. We…

Optimization and Control · Mathematics 2025-08-04 Aloïs Duguet , Margarida Carvalho , Gabriele Dragotto , Sandra Ulrich Ngueveu

In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…

Combinatorics · Mathematics 2012-11-08 Fraser Stewart

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…

Logic in Computer Science · Computer Science 2025-02-26 Pablo F. Castro , Pedro D'Argenio

This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions and assignments. In a matching game, the value of a…

Computer Science and Game Theory · Computer Science 2013-07-02 Haris Aziz , Bart de Keijzer

We develop a symmetric monoidal closed category of games, incorporating sums and products, to model quantum computation at higher types. This model is expressive, capable of representing all unitary operators at base types. It is compatible…

Programming Languages · Computer Science 2024-04-11 Samson Abramsky , Radha Jagadeesan