scholarly journals Distributed computation of generalized Nash equilibria in quadratic aggregative games with affine coupling constraints

Author(s):  
Dario Paccagnan ◽  
Basilio Gentile ◽  
Francesca Parise ◽  
Maryam Kamgarpour ◽  
John Lygeros
2013 ◽  
Vol 23 (1) ◽  
pp. 452-474 ◽  
Author(s):  
D. Dorsch ◽  
H. Th. Jongen ◽  
V. Shikhman

2019 ◽  
Vol 64 (4) ◽  
pp. 1426-1439 ◽  
Author(s):  
Tatiana Tatarenko ◽  
Maryam Kamgarpour

Automatica ◽  
2020 ◽  
Vol 117 ◽  
pp. 108959 ◽  
Author(s):  
Francesca Parise ◽  
Sergio Grammatico ◽  
Basilio Gentile ◽  
John Lygeros

2010 ◽  
Vol 12 (03) ◽  
pp. 253-261
Author(s):  
RYUSUKE SHINOHARA

The relationship between coalition-proof (Nash) equilibria in a normal-form game and those in its subgame is examined. A subgame of a normal-form game is a game in which the strategy sets of all players in the subgame are subsets of those in the normal-form game. In this paper, focusing on a class of aggregative games, we provide a sufficient condition for the aggregative game under which every coalition-proof equilibrium in a subgame is also coalition-proof in the original normal-form game. The stringency of the sufficient condition means that a coalition-proof equilibrium in a subgame is rarely a coalition-proof equilibrium in the whole game.


Sign in / Sign up

Export Citation Format

Share Document