Cooperative games with homogeneous groups of participants

Theory and Decision 79 (3):451-461 (2015)
  Copy   BIBTEX


We consider a class of games, which we call “groups’ games”, in which players are partitioned into classes within which players may be considered indistinguishable. We compute explicit formulas for some of the principal values restricted to these games. This is particularly useful for dealing with games with a large number of players where the usual formulas would be impractical to compute. We give several examples that illustrate how this idea may be applied to concrete situations.



    Upload a copy of this work     Papers currently archived: 79,898

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Generalized externality games.Paula Corcho & José Luis Ferreira - 2003 - Theory and Decision 54 (2):163-184.
V. is the prisoners' dilemma all of sociology?Arthur L. Stinchcombe - 1980 - Inquiry: An Interdisciplinary Journal of Philosophy 23 (2):187 – 192.
What niche did human cooperativeness evolve in?Hannes Rusch - 2013 - Ethics and Politics 15 (2):82-100.
A Non-cooperative Axiomatization of the Core.Akira Okada & Eyal Winter - 2002 - Theory and Decision 53 (1):1-28.
Simple stable homogeneous groups.Alexander Berenstein - 2003 - Journal of Symbolic Logic 68 (4):1145-1162.
Reducts of random hypergraphs.Simon Thomas - 1996 - Annals of Pure and Applied Logic 80 (2):165-193.
Digraph Competitions and Cooperative Games.René van Den Brink & Peter Borm - 2002 - Theory and Decision 53 (4):327-342.


Added to PP

19 (#605,714)

6 months
1 (#479,521)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references