Decentralized strategies for finite population linear–quadratic–Gaussian games and teams

نویسندگان

چکیده

This paper is concerned with a new class of mean-field games which involve finite number agents. Necessary and sufficient conditions are obtained for the existence decentralized open-loop Nash equilibrium in terms non-standard forward–backward stochastic differential equations (FBSDEs). By solving FBSDEs, we design set strategies by virtue two Riccati equations. Instead ɛ-Nash classical games, shown to be equilibrium. For infinite-horizon problem, simple condition given solvability algebraic equation arising from consensus. Furthermore, social optimal control problem studied. Under mild condition, corresponding cost given.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Dynamics for Finite Opinion Games

Game theory studies situations in which strategic players can modify the state of a given system, due to the absence of a central authority. Solution concepts, such as Nash equilibrium, are defined to predict the outcome of such situations. In the spirit of the field, we then look at the computation of solution concepts by means of decentralized dynamics. These are algorithms in which players m...

متن کامل

Finite-State Strategies in Regular Infinite Games

Abs t rac t . This paper surveys work on the synthesis of reactive programs which implement winning strategies in infinite two-person games. The representation of such games by Muller automata and by game graphs (as introduced by McNaughton) is considered, and the construction of winning strategies is described in three stages, covering "guarantee games", "recurrence games", and generM regular ...

متن کامل

Finite-state Strategies in Delay Games

What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question and present a very general framework for computing such strategies: they exist for all winning conditions that are recognized by automata with acceptance conditions that satisfy a certain aggregation property. Our framework also yields upper bounds on the complexity of determining the winner of suc...

متن کامل

Roles and Teams Hedonic Games

We have introduced a new model of hedonic coalition formation game, which we call Roles and Teams Hedonic Games (RTHG) (Spradling et al. 2013). In this model, agents view coalitions as compositions of available roles. An agent’s utility for a partition is based upon which role she fulfills within the coalition and which roles are being fulfilled within the coalition. The major contributions of ...

متن کامل

Decentralized Q-Learning for Stochastic Dynamic Games

Abstract. There are only a few learning algorithms applicable to stochastic dynamic games. Learning in games is generally difficult because of the non-stationary environment in which each decision maker aims to learn its optimal decisions with minimal information in the presence of the other decision makers who are also learning. In the case of dynamic games, learning is more challenging becaus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automatica

سال: 2023

ISSN: ['1873-2836', '0005-1098']

DOI: https://doi.org/10.1016/j.automatica.2022.110789