Distributed Computation of Nash Equilibria for Monotone Aggregative Games via Iterative Regularization

Author(s):  
Jinlong Lei ◽  
Uday V. Shanbhag ◽  
Jie Chen
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.


2011 ◽  
pp. 65-87 ◽  
Author(s):  
A. Rubinstein

The article considers some aspects of the patronized goods theory with respect to efficient and inefficient equilibria. The author analyzes specific features of patronized goods as well as their connection with market failures, and conjectures that they are related to the emergence of Pareto-inefficient Nash equilibria. The key problem is the analysis of the opportunities for transforming inefficient Nash equilibrium into Pareto-optimal Nash equilibrium for patronized goods by modifying the institutional environment. The paper analyzes social motivation for institutional modernization and equilibrium conditions in the generalized Wicksell-Lindahl model for patronized goods. The author also considers some applications of patronized goods theory to social policy issues.


Sign in / Sign up

Export Citation Format

Share Document