English
Related papers

Related papers: An accretive operator approach to ergodic zero-sum…

200 papers

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 study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

Analysis of PDEs · Mathematics 2020-01-22 Davit Martirosyan , Vahagn Nersesyan

An optimal ergodic control problem (EC problem, for short) is investigated for a linear stochastic differential equation with quadratic cost functional. Constant nonhomogeneous terms, not all zero, appear in the state equation, which lead…

Optimization and Control · Mathematics 2020-04-24 Hongwei Mei , Qingmeng Wei , Jiongmin Yong

Through a stochastic control theoretic approach, we analyze reputation games where a strategic long-lived player acts in a sequential repeated game against a collection of short-lived players. The key assumption in our model is that the…

Optimization and Control · Mathematics 2020-01-22 Nuh Aygün Dalkıran , Serdar Yüksel

Drifts of asset returns are notoriously difficult to model accurately and, yet, trading strategies obtained from portfolio optimization are very sensitive to them. To mitigate this well-known phenomenon we study robust growth-optimization…

Mathematical Finance · Quantitative Finance 2026-01-01 Balint Binkert , David Itkin , Paul Mangers Bastian , Josef Teichmann

Games on graphs provide a natural model for reactive non-terminating systems. In such games, the interaction of two players on an arena results in an infinite path that describes a run of the system. Different settings are used to model…

Computer Science and Game Theory · Computer Science 2011-06-08 Krishnendu Chatterjee , Nathanaël Fijalkow

Designing distributed algorithms for multi-agent problems is vital for many emerging application domains, and game-theoretic approaches are emerging as a useful paradigm to design such algorithms. However, much of the emphasis of the…

Systems and Control · Electrical Eng. & Systems 2024-05-03 Rohit Konda , Rahul Chandan , David Grimsman , Jason R. Marden

This paper considers a class of reinforcement-learning that belongs to the family of Learning Automata and provides a stochastic-stability analysis in strategic-form games. For this class of dynamics, convergence to pure Nash equilibria has…

Computer Science and Game Theory · Computer Science 2017-02-28 Georgios C. Chasparis

Expanding the ideas of the author's paper 'Nonexpansive maps and option pricing theory' (Kibernetica 34:6 (1998), 713-724) we develop a pure game-theoretic approach to option pricing, by-passing stochastic modeling. Risk neutral…

Optimization and Control · Mathematics 2022-05-03 Vassili Kolokoltsov

We consider discrete-time uncertain processes with finite state space and study the properties of game-theoretic upper expectations developed by Shafer and Vovk. We start by proving some basic properties, e.g. monotonicity, law of iterated…

Probability · Mathematics 2019-04-02 Natan T'Joens , Jasper De Bock , Gert de Cooman

We study the problem of characterizing the set of games that are consistent with observed equilibrium play. Our contribution is to develop and analyze a new methodology based on convex optimization to address this problem for many classes…

Computer Science and Game Theory · Computer Science 2017-03-23 Juba Ziani , Venkat Chandrasekaran , Katrina Ligett

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

We explore a mechanism of decision-making in Mean Field Games with myopic players. At each instant, agents set a strategy which optimizes their expected future cost by assuming their environment as immutable. As the system evolves, the…

Optimization and Control · Mathematics 2018-02-05 Charafeddine Mouzouni

We analyze the problem of distributed power allocation for orthogonal multiple access channels by considering a continuous non-cooperative game whose strategy space represents the users' distribution of transmission power over the network's…

Computer Science and Game Theory · Computer Science 2015-03-19 Panayotis Mertikopoulos , Elena V. Belmega , Aris L. Moustakas , Samson Lasaulce

We introduce and study the axiom of null player neutrality in the context of cooperative games with transferable utility (TU-games). This axiom weakens the classical coalitional strategic equivalence: rather than requiring that augmenting a…

Theoretical Economics · Economics 2026-05-20 J. C. Gonçalves-Dosantos , R. Martínez , J. Sánchez-Soriano

Using semi-tensor product (STP) of matrices, the profile evolutionary equation (PEE) for repeated finite games is obtained. By virtue of PEE, the zero-determinant (ZD) strategies are developed for general finite games. A formula is then…

Optimization and Control · Mathematics 2023-11-14 Daizhan Cheng , Changxi Li

We consider a class of hierarchical noncooperative $N$-player games where the $i$th player solves a parametrized stochastic mathematical program with equilibrium constraints (MPEC) with the caveat that the implicit form of the $i$th…

Optimization and Control · Mathematics 2022-02-23 Shisheng Cui , Uday V. Shanbhag

We are interested in the convergence of the value of n-stage games as n goes to infinity and the existence of the uniform value in stochastic games with a general set of states and finite sets of actions where the transition is commutative.…

Optimization and Control · Mathematics 2016-04-22 Xavier Venel

We investigate zero-sum turn-based two-player stochastic games in which the objective of one player is to maximize the amount of rewards obtained during a play, while the other aims at minimizing it. We focus on games in which the minimizer…

Logic in Computer Science · Computer Science 2022-05-20 Pablo F. Castro , Pedro R. D'Argenio , Luciano Putruele , Ramiro Demasi

An ideal strategy in zero-sum games should not only grant the player an average reward no less than the value of Nash equilibrium, but also exploit the (adaptive) opponents when they are suboptimal. While most existing works in Markov games…

Machine Learning · Computer Science 2022-06-15 Qinghua Liu , Yuanhao Wang , Chi Jin