Minimal exact balancedness

E.R.M.A. Lohmann, P.E.M. Borm, P.J.J. Herings

Research output: Contribution to journalArticleScientificpeer-review

3 Citations (Scopus)

Abstract

To verify whether a transferable utility game is exact, one has to check a linear inequality for each exact balanced collection of coalitions. This paper studies the structure and properties of the class of exact balanced collections. Comparing the definition of exact balanced collections with the definition of balanced collections, the weight vector of a balanced collection must be positive whereas the weight vector for an exact balanced collection 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.
Original languageEnglish
Pages (from-to)127-135
JournalMathematical Social Sciences
Volume64
Issue number2
DOIs
Publication statusPublished - 2012

Fingerprint Dive into the research topics of 'Minimal exact balancedness'. Together they form a unique fingerprint.

Cite this