English
Related papers

Related papers: Commutative Stochastic Games

200 papers

We study the problem of finding equilibrium strategies in multi-agent games with incomplete payoff information, where the payoff matrices are only known to the players up to some bounded uncertainty sets. In such games, an ex-post…

Computer Science and Game Theory · Computer Science 2020-07-14 Wenshuo Guo , Mihaela Curmei , Serena Wang , Benjamin Recht , Michael I. Jordan

We consider infinite-state turn-based stochastic games of two players, Box and Diamond, who aim at maximizing and minimizing the expected total reward accumulated along a run, respectively. Since the total accumulated reward is unbounded,…

Computer Science and Game Theory · Computer Science 2012-08-09 Tomáš Brázdil , Antonín Kučera , Petr Novotný

Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis. Optimal strategies may require randomisation when dealing with inherently…

Computer Science and Game Theory · Computer Science 2024-11-25 James C. A. Main , Mickael Randour

Probabilistic game structures combine both nondeterminism and stochasticity, where players repeatedly take actions simultaneously to move to the next state of the concurrent game. Probabilistic alternating simulation is an important tool to…

Logic in Computer Science · Computer Science 2019-07-10 Chenyi Zhang , Jun Pang

In many multi-player interactions, players incur strictly positive costs each time they execute actions e.g. 'menu costs' or transaction costs in financial systems. Since acting at each available opportunity would accumulate prohibitively…

Multiagent Systems · Computer Science 2024-08-02 David Mguni

Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…

Computer Science and Game Theory · Computer Science 2021-09-20 Tobias Winkler , Maximilian Weininger

Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…

Computational Complexity · Computer Science 2022-07-21 Tobias Winkler , Maximilian Weininger

This paper aims to solve two fundamental problems on finite or infinite horizon dynamic games with perfect or almost perfect information. Under some mild conditions, we prove (1) the existence of subgame-perfect equilibria in general…

Economics · Quantitative Finance 2015-04-01 Wei He , Yeneng Sun

In this paper we study mean field games with possibly multiple mean field equilibria. Instead of focusing on the individual equilibria, we propose to study the set of values over all possible equilibria, which we call the set value of the…

Optimization and Control · Mathematics 2024-03-19 Melih Iseri , Jianfeng Zhang

We study a dynamic game with a large population of players who choose actions from a finite set in continuous time. Each player has a state in a finite state space that evolves stochastically with their actions. A player's reward depends…

Systems and Control · Electrical Eng. & Systems 2025-11-04 Leonardo Pedroso , Andrea Agazzi , W. P. M. H. Heemels , Mauro Salazar

Certain but important classes of strategic-form games, including zero-sum and identical-interest games, have the fictitious-play-property (FPP), i.e., beliefs formed in fictitious play dynamics always converge to a Nash equilibrium (NE) in…

Computer Science and Game Theory · Computer Science 2022-05-24 Muhammed O. Sayin , Kaiqing Zhang , Asuman Ozdaglar

We consider multiplayer stochastic games in which the payoff of each player is a bounded and Borel-measurable function of the infinite play. By using a generalization of the technique of Martin (1998) and Maitra and Sudderth (1998), we show…

Optimization and Control · Mathematics 2022-08-26 János Flesch , Eilon Solan

The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within $\epsilon$ in time exponential in a polynomial in the size of the game times polynomial in logarithmic in…

Computer Science and Game Theory · Computer Science 2008-12-18 Krishnendu Chatterjee , Rupak Majumdar , Thomas A. Henzinger

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 study two-player security games which can be viewed as sequences of nonzero-sum matrix games played by an Attacker and a Defender. The evolution of the game is based on a stochastic fictitious play process. Players do not have access to…

Computer Science and Game Theory · Computer Science 2010-03-16 Kien C. Nguyen , Tansu Alpcan , Tamer Basar

We study strategic interaction in data-driven games where players face uncertainty about payoff distributions inferred from finite samples. To model calibrated attitudes toward such uncertainty, we formulate distributionally robust games…

Computer Science and Game Theory · Computer Science 2026-05-28 Bharat Gangwani , Arunesh Sinha

We study $\lambda$-discounted zero-sum games as the discount factor $\lambda$ approaches $0$ (that is, the players are more and more patient), in the context of games with stage duration. In stochastic games with stage duration $h$, players…

Optimization and Control · Mathematics 2026-02-20 Ivan Novikov

We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model…

Logic in Computer Science · Computer Science 2010-06-09 Krishnendu Chatterjee , Rupak Majumdar

We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…

Logic in Computer Science · Computer Science 2016-03-18 Stéphane Le Roux , Arno Pauly

Two-player stochastic games are games with two 2 players and a randomised entity called "nature". A natural question to ask in this framework is the existence of strategies that ensure that an event happens with probability 1 (almost-sure…

Computer Science and Game Theory · Computer Science 2018-06-27 Youssouf Oualhadj , Léo Tible , Daniele Varacca