Relations are established between information sharing (IS) situations and IS-games on one hand and information collecting (IC) situations and IC-games on the other hand. It is shown that IC-games can be obtained as convex combinations of so-called local games. Properties are described which IC-games possess if all related local games have the respective properties. Special attention is paid to the classes of convex IC-games and of k-concave IC-games. This last class turns out to consist of total big boss games. For the class of total big boss games a new solution concept is introduced: bi-monotonic allocation schemes.
|Place of Publication||Tilburg|
|Number of pages||10|
|Publication status||Published - 2000|
|Name||CentER Discussion Paper|
- cooperative games
- big boss games
- bi-monotonic allocation scheme