Dissection of solutions in cooperative game theory using representation techniques (Q870752)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5134041
Language Label Description Also known as
default for all languages
No label defined
    English
    Dissection of solutions in cooperative game theory using representation techniques
    scientific article; zbMATH DE number 5134041

      Statements

      Dissection of solutions in cooperative game theory using representation techniques (English)
      0 references
      0 references
      15 March 2007
      0 references
      The authors study standard cooperative TU-games with \(n\) players in terms of their values. They analyze the values of games under such properties like efficiency, symmetricity, nullity and duality. But for many readers this paper can seem interesting with respect to the fact that the authors apply quite a new method, using nontrivial tools of algebra like basic representation theory of the group of permutation \(S_n\). The starting point in this method is to consider some direct sum decomposition of the vector space of all coopeerative games into special subspaces, and next to consider properties of linear, symmetric solutions restricted to those subspaces. The authors show that this new method enables us to get both some classical results about values of cooperative games and several new ones. Among other things, some new formulae for the Shapley value have been obtained.
      0 references
      symmetric linear solution
      0 references
      efficient solution
      0 references
      null linear symmetric solution
      0 references
      the Shapley value
      0 references
      duality
      0 references

      Identifiers