Cores of games with restricted cooperation

U. Faigle

Research output: Contribution to journalArticleAcademicpeer-review

57 Citations (Scopus)
76 Downloads (Pure)


Games with restricted cooperation are cooperativeN-person games with sidepayments, where the collection of feasible coalitions need not comprise all subsets of players and thus is restricted. We study balanced and completely balanced games in this context and derive the corresponding core theorems from a sandwich theorem for set functions within the setting of linear programming. In particular, we discuss general convex games, which Edmonds and Giles (1977) have shown to be of particular importance also in combinatorial optimization.
Original languageEnglish
Pages (from-to)405-422
JournalZeitschrift für Operations Research
Issue number6
Publication statusPublished - 1989


  • METIS-306402
  • IR-92533


Dive into the research topics of 'Cores of games with restricted cooperation'. Together they form a unique fingerprint.

Cite this