English
Related papers

Related papers: Fast Planning in Stochastic Games

200 papers

We present novel techniques for neuro-symbolic concurrent stochastic games, a recently proposed modelling formalism to represent a set of probabilistic agents operating in a continuous-space environment using a combination of neural network…

Computer Science and Game Theory · Computer Science 2022-06-22 Rui Yan , Gabriel Santos , Xiaoming Duan , David Parker , Marta Kwiatkowska

A class of nonzero-sum stochastic dynamic games with imperfect information structure is investigated. The game involves an arbitrary number of players, modeled as homogeneous Markov decision processes, aiming to find a sequential Nash…

Optimization and Control · Mathematics 2019-12-17 Jalal Arabneydi , Amir G. Aghdam

This paper presents a new primal-dual method for computing an equilibrium of generalized (continuous) Nash game (referred to as generalized Nash equilibrium problem (GNEP)) where each player's feasible strategy set depends on the other…

Computer Science and Game Theory · Computer Science 2022-03-04 Jong Gwang Kim

In this paper, we consider a differential stochastic zero-sum game in which two players intervene by adopting impulse controls in a finite time horizon. We provide a numerical solution as an approximation of the value function, which turns…

Optimization and Control · Mathematics 2024-10-14 Antoine Zolome , Brahim El Asri

This paper considers the discounted criterion of nonzero-sum decentralized stochastic games with prospect players. The state and action spaces are finite. The state transition probability is nonstationary. Each player independently controls…

Optimization and Control · Mathematics 2024-05-16 Yiting Wu , Junyu Zhang

We study pure-strategy Nash equilibria in multi-player concurrent deterministic games, for a variety of preference relations. We provide a novel construction, called the suspect game, which transforms a multi-player concurrent game into a…

Logic in Computer Science · Computer Science 2017-01-11 Patricia Bouyer , Romain Brenguier , Nicolas Markey , Michael Ummels

Auctions are modeled as Bayesian games with continuous type and action spaces. Determining equilibria in auction games is computationally hard in general and no exact solution theory is known. We introduce an algorithmic framework in which…

Computer Science and Game Theory · Computer Science 2023-05-10 Martin Bichler , Maximilian Fichtl , Matthias Oberlechner

In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a…

Computer Science and Game Theory · Computer Science 2007-05-23 Constantinos Daskalakis

In this paper, we study a distributed continuous-time design for aggregative games with coupled constraints in order to seek the generalized Nash equilibrium by a group of agents via simple local information exchange. To solve the problem,…

Optimization and Control · Mathematics 2022-06-14 Shu Liang , Peng Yi , Yiguang Hong

Stochastic games are an important class of problems that generalize Markov decision processes to game theoretic scenarios. We consider finite state two-player zero-sum stochastic games over an infinite time horizon with discounted rewards.…

Optimization and Control · Mathematics 2008-06-17 Parikshit Shah , Pablo A. Parrilo

Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…

Computer Science and Game Theory · Computer Science 2026-05-11 Ian Gemp , Crystal Qian , Marc Lanctot , Kate Larson

This paper aims to design a distributed coordination algorithm for solving a multi-agent decision problem with a hierarchical structure. The primary goal is to search the Nash equilibrium of a noncooperative game such that each player has…

Optimization and Control · Mathematics 2022-05-17 Xiaoyu Ma , Jinlong Lei , Peng Yi , Jie Chen

There has been significant recent progress in algorithms for approximation of Nash equilibrium in large two-player zero-sum imperfect-information games and exact computation of Nash equilibrium in multiplayer strategic-form games. While…

Computer Science and Game Theory · Computer Science 2025-10-01 Sam Ganzfried

In this paper, a multi-cluster game with high-order players is investigated. Different from the well-known multi-cluster games, the dynamics of players are taken into account in our problem. Due to the high-order dynamics of players,…

Systems and Control · Electrical Eng. & Systems 2021-06-28 Zhenhua Deng , Yangyang Liu

This article introduces a class of $Nash$ games among $Stackelberg$ players ($NASPs$), namely, a class of simultaneous non-cooperative games where the players solve sequential Stackelberg games. Specifically, each player solves a…

Computer Science and Game Theory · Computer Science 2025-03-04 Margarida Carvalho , Gabriele Dragotto , Felipe Feijoo , Andrea Lodi , Sriram Sankaranarayanan

We consider multi-agent decision making, where each agent optimizes its cost function subject to constraints. Agents' actions belong to a compact convex Euclidean space and the agents' cost functions are coupled. We propose a distributed…

Optimization and Control · Mathematics 2016-12-01 Tatiana Tatarenko , Maryam Kamgarpour

Generating payoff matrices of normal-form games at random, we calculate the frequency of games with a unique pure strategy Nash equilibrium in the ensemble of $n$-player, $m$-strategy games. These are perfectly predictable as they must…

Theoretical Economics · Economics 2020-11-03 Samuel C. Wiese , Torsten Heinrich

We consider a multi-player stochastic differential game with linear McKean-Vlasov dynamics and quadratic cost functional depending on the variance and mean of the state and control actions of the players in open-loop form. Finite and…

Probability · Mathematics 2018-12-04 Enzo Miller , Huyen Pham

In the context of large population symmetric games, approximate Nash equilibria are introduced through equilibrium solutions of the corresponding mean field game in the sense that the individual gain from optimal unilateral deviation under…

Computer Science and Game Theory · Computer Science 2026-01-30 Mao Fabrice Djete , Nizar Touzi

In this paper, we settle the sampling complexity of solving discounted two-player turn-based zero-sum stochastic games up to polylogarithmic factors. Given a stochastic game with discount factor $\gamma\in(0,1)$ we provide an algorithm that…

Machine Learning · Computer Science 2019-08-30 Aaron Sidford , Mengdi Wang , Lin F. Yang , Yinyu Ye
‹ Prev 1 4 5 6 7 8 10 Next ›