Minimal exact balancedness

E. Lohmann, Peter Borm and P. Jean-Jacques Herings

Mathematical Social Sciences, 2012, vol. 64, issue 2, 127-135

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.

Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489612000054
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Minimal Exact Balancedness (2011)
Working Paper: Minimal Exact Balancedness (2011)
Working Paper: Minimal exact balancedness (2011)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:64:y:2012:i:2:p:127-135

DOI: 10.1016/j.mathsocsci.2012.01.002

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().