Network games and solutions from decomposition techniques
Article
Overview
Research
Identity
Additional Document Info
View All
Overview
abstract
In this work we provide several decomposition techniques for the study of solutions for network games that satisfy the axioms of additivity, anonymity and homogeneity. In particular, we derive a decomposition of the vector space of network games and identify the type of problems that are relevant to the study of such solutions. We then offer several applications of this approach for solutions of network games with three and four players
