Stochastic Generalized Dynamic Games with Coupled Chance Constraints
Designing multi-agent systems with safety constraints and uncertain dynamics is a challenging problem. This paper studies a stochastic dynamic non-cooperative game with coupling safety chance constraints. The uncertainty is assumed to satisfy a concentration of measure property. Firstly, due to the non-convexity of chance constraints, a convex under-approximation of chance constraints is given using constraints on the expectation. Then, the conditions for the existence of the stochastic generalized Nash equilibrium (SGNE) of the under-approximated game are investigated, and the relation between the $\varepsilon-$SGNE of the original game and the under-approximated one is derived. A sampling-based algorithm is proposed for the SGNE seeking of the under-approximated game that does not require knowing the distribution of the uncertainty nor the analytical computation of expectations. Finally, under some assumptions on the game's pseudo-gradient mapping, the almost sure convergence of the algorithm to SGNE is proven. A numerical study is carried out on demand-side management in microgrids with shared battery to demonstrate the applicability of the proposed scheme.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
An Addendum to the Problem of Zero-Sum LQ Stochastic Mean-Field Dynamic Games\\ (Extended version)
In this paper, we first address a linear quadratic mean-field game problem with a leader-follower structure. By adopting a Riccati-type approach, we show how one can obtain a state-feedback representation of the pairs of…
Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
In this paper, we consider two-player zero-sum matrix and stochastic games and develop learning dynamics that are payoff-based, convergent, rational, and symmetric between the two players. Specifically, the learning dyna…
A Finite-Sample Analysis of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
We study two-player zero-sum stochastic games, and propose a form of independent learning dynamics called Doubly Smoothed Best-Response dynamics, which integrates a discrete and doubly smoothed variant of the best-respon…
Quantifying Skill and Chance: A Unified Framework for the Geometry of Games
We introduce a quantitative framework for separating skill and chance in games by modeling them as complementary sources of control over stochastic decision trees. We define the Skill-Luck Index S(G) in [-1, 1] by decomp…
Scenario-Game ADMM: A Parallelized Scenario-Based Solver for Stochastic Noncooperative Games
Decision-making in multi-player games can be extremely challenging, particularly under uncertainty. In this work, we propose a new sample-based approximation to a class of stochastic, general-sum, pure Nash games, where …
Decision Making