相关论文: General limit value in zero-sum stochastic games

Cotangent sums are associated to the zeros of the Estermann zeta function. They have also proven to be of importance in the Nyman-Beurling criterion for the Riemann Hypothesis. The main result of the paper is the proof of the existence of a…

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…

In this work, we study convergence in probability and almost sure convergence for weighted partial sums of random variables that are related to the class of generalized Oppenheim expansions. It is worth noting that the random variables…

In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…

This short note establishes positionality of mean-payoff games over infinite game graphs by constructing a well-founded monotone universal graph.

In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…

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…

For a zero-sum stochastic game which does not satisfy the Isaacs condition, we provide a value function representation for an Isaacs-type equation whose Hamiltonian lies in between the lower and upper Hamiltonians, as a convex combination…

We derive concentration inequalities for sums of independent and identically distributed random variables that yield non-asymptotic generalizations of several strong laws of large numbers including some of those due to Kolmogorov [1930],…

We study a two-player zero-sum stochastic differential game with asymmetric information where the payoff depends on a controlled continuous-time Markov chain X with finite state space which is only observed by player 1. This model was…

We introduce a class of fully nonlinear mean field games posed in $[0,T]\times\mathbb{R}^d$. We justify that they are related to controlled local or nonlocal diffusions, and more generally in our setting, to a new control interpretation…

We study some ergodicity property of zero-sum stochastic games with a finite state space and possibly unbounded payoffs. We formulate this property in operator-theoretical terms, involving the solvability of an optimality equation for the…

Many emerging problems involve teams of agents taking part in a game. Such problems require a stochastic analysis with regard to the correlation structures among the agents belonging to a given team. In the context of Standard Borel spaces,…

In 1996, Mallozzi and Morgan [33] proposed a new model for Stackelberg games which we refer here to as the Bayesian approach. The leader has only partial information about how followers select their reaction among possibly multiple optimal…

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…

This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. Fully quantum nonlocal games are a generalization of nonlocal games, where both questions and answers are quantum and the referee…

We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives…

Optimization under uncertainty is a fundamental problem in learning and decision-making, particularly in multi-agent systems. Previously, Feldman, Kalai, and Tennenholtz [2010] demonstrated the ability to efficiently compete in repeated…

We study zero-sum differential games with state constraints and one-sided information, where the informed player (Player 1) has a categorical payoff type unknown to the uninformed player (Player 2). The goal of Player 1 is to minimize his…

Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of perfect information, they admit memoryless optimal strategies for both players and can be solved in…