English
Related papers

Related papers: A Zero-Sum Stochastic Game with Compact Action Set…

200 papers

The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…

Computer Science and Game Theory · Computer Science 2013-12-30 Fedor Sandomirskiy

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…

Quantum Physics · Physics 2024-02-27 Archan Mukhopadhyay , Saikat Sur , Tanay Saha , Shubhadeep Sadhukhan , Sagar Chakraborty

Zero-sum stochastic games have found important applications in a variety of fields, from machine learning to economics. Work on this model has primarily focused on the computation of Nash equilibrium due to its effectiveness in solving…

Computer Science and Game Theory · Computer Science 2022-11-28 Denizalp Goktas , Jiayi Zhao , Amy Greenwald

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

Mean payoff stochastic games can be studied by means of a nonlinear spectral problem involving the Shapley operator: the ergodic equation. A solution consists in a scalar, called the ergodic constant, and a vector, called bias. The…

Optimization and Control · Mathematics 2016-05-17 Antoine Hochart

We study a model of two-player, zero-sum, stopping games with asymmetric information. We assume that the payoff depends on two continuous-time Markov chains (X, Y), where X is only observed by player 1 and Y only by player 2, implying that…

Optimization and Control · Mathematics 2017-12-06 Fabien Gensbittel , Christine Grün

In the present paper we consider one class of zero-sum games with discontinuous payoffs which may have no solutions in the sets of pure or mixed strategies. We show that, however, the solution always exists in the set of so-called $\mathcal…

Functional Analysis · Mathematics 2007-10-15 V. Derr , D. Kinzebulatov

Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three…

Computer Science and Game Theory · Computer Science 2022-07-21 Jan Kretinsky , Emanuel Ramneantu , Alexander Slivinskiy , Maximilian Weininger

Zero-sum games are natural, if informal, analogues of closed physical systems where no energy/utility can enter or exit. This analogy can be extended even further if we consider zero-sum network (polymatrix) games where multiple agents…

Computer Science and Game Theory · Computer Science 2019-03-06 James P. Bailey , Georgios Piliouras

In the standard minority game, each agent in the minority group receives the same payoff regardless of the size of the minority group. Of great interest for real social and biological systems are cases in which the payoffs to members of the…

Adaptation and Self-Organizing Systems · Physics 2009-10-31 Yi Li , Adrian VanDeemen , Robert Savit

In this paper we investigate two-player zero-sum stochastic differential games with an ergodic payoff, in which the diffusion coefficient does not need to be non-degenerate. We first establish the existence of a viscosity solution to the…

Optimization and Control · Mathematics 2026-01-21 Juan Li , Wenqiang Li , Yanwei Li , Huaizhong Zhao

We give an example of a finite-state two-player turn-based stochastic game with safety objectives for both players which has no stationary Nash equilibrium. This answers an open question of Secchi and Sudderth.

Optimization and Control · Mathematics 2019-09-18 Kristoffer Arnsfelt Hansen , Mikhail Raskin

Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them…

Computer Science and Game Theory · Computer Science 2015-07-01 Hugo Gimbert , Florian Horn

We study a finite-horizon two-person zero-sum risk-sensitive stochastic game for continuous-time Markov chains and Borel state and action spaces, in which payoff rates, transition rates and terminal reward functions are allowed to be…

Optimization and Control · Mathematics 2021-03-09 Junyu Zhang , Xianping Guo , Li Xia

Nonzero-sum stochastic differential games with impulse controls offer a realistic and far-reaching modelling framework for applications within finance, energy markets, and other areas, but the difficulty in solving such problems has…

Numerical Analysis · Mathematics 2020-06-29 Diego Zabaljauregui

This paper investigates mixed strategies in dynamic games with perfect information. We present an example to show that a player may obtain higher payoff by playing mixed strategy. By contrast, the main result of the paper shows that every…

Optimization and Control · Mathematics 2020-01-01 Enxian Chen , Wei He , Yeneng Sun , Hanping Xu

In this paper, zero-sum mean-field type games (ZSMFTG) with linear dynamics and quadratic cost are studied under infinite-horizon discounted utility function. ZSMFTG are a class of games in which two decision makers whose utilities sum to…

Optimization and Control · Mathematics 2020-09-02 René Carmona , Kenza Hamidouche , Mathieu Laurière , Zongjun Tan

We investigate a linear quadratic stochastic zero-sum game where two players lobby a political representative to invest in a wind turbine farm. Players are time-inconsistent because they discount performance with a non-constant rate. Our…

General Economics · Economics 2023-09-04 Ali Lazrak , Hanxiao Wang , Jiongmin Yong

We study a two-player, zero-sum, stochastic game with incomplete information on one side in which the players are allowed to play more and more frequently. The informed player observes the realization of a Markov chain on which the payoffs…

Optimization and Control · Mathematics 2013-07-15 Pierre Cardaliaguet , Catherine Rainer , Dinah Rosenberg , Nicolas Vieille

We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent positional advantages in physical conflict such as high…

Computer Science and Game Theory · Computer Science 2024-07-11 Farid Arthaud , Edan Orzech , Martin Rinard