Article thumbnail

Minimal exact balancedness

By Lohmann E., Borm P. and Herings P.J.J.


To verify whether a transferable utility game is exact, one has to check a linear inequalityfor each exact balanced collection of coalitions. This paper studies the structure andproperties of the class of exact balanced collections. Comparing the definition of exactbalanced collections with the definition of balanced collections, the weight vector of abalanced collection must be positive whereas the weight vector for an exact balancedcollection may contain one negative weight. We investigate minimal exact balanced collections, and show that only these collections are needed to obtain exactness. The relation between minimality of an exact balanced collection and uniqueness of the corresponding weight vector is analyzed. We show how the class of minimal exact balanced collections can be partitioned into three basic types each of which can be systematically generated.operations research and management science;

OAI identifier:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles


  1. (1965). An inductive method for constructing minimal balanced collections of finite sets.
  2. (2009). Convex Multi-Choice Cooperative Games: Characterizations and Monotonic Allocation Schemes.
  3. (1971). Cores of convex games.
  4. (1972). Cores of exact games.
  5. K´ oczy (2007). Balancedness conditions for exact games.
  6. K´ oczy (2009). Stable allocations of risk.
  7. (2005). Multi-issue allocation situations.
  8. (1967). On balanced sets and cores.
  9. (1963). Some applications of linear programming methods to the theory of cooperative games (In Russian).
  10. (1953). Some theorems on n-person games.
  11. Sudh¨ olter (2003). Introduction to the theory of cooperative games.