Weightedness and structural characterization of hierarchical simple games

Tatiana Gvozdeva, Ali Hameed and Arkadii Slinko

Mathematical Social Sciences, 2013, vol. 65, issue 3, 181-189

Abstract: In this paper we give structural characterizations of disjunctive and conjunctive hierarchical simple games by characterizing them as complete games with a unique shift-maximal losing coalition, and a unique shift-minimal winning coalition, respectively. We prove canonical representation theorems for both types of hierarchical games and establish duality between them. We characterize the disjunctive and conjunctive hierarchical games that are weighted majority games. This paper was inspired by Beimel et al. (2008) and Farràs and Padró (2010) characterizations of ideal weighted threshold access structures of secret sharing schemes.

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

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

Related works:
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:65:y:2013:i:3:p:181-189

DOI: 10.1016/j.mathsocsci.2012.11.007

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 ().