Abstract
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 language | English |
---|---|
Pages (from-to) | 405-422 |
Journal | Zeitschrift für Operations Research |
Volume | 33 |
Issue number | 6 |
DOIs | |
Publication status | Published - 1989 |