Weightedness and structural characterization of hierarchical simple games
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.
Year of publication: |
2013
|
---|---|
Authors: | Gvozdeva, Tatiana ; Hameed, Ali ; Slinko, Arkadii |
Published in: |
Mathematical Social Sciences. - Elsevier, ISSN 0165-4896. - Vol. 65.2013, 3, p. 181-189
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Weightedness and structural characterization of hierarchical simple games
Gvozdeva, Tatiana, (2013)
-
Hierarchical Simple Games : Weightedness and Structural Characterization
Gvozdeva, Tatiana, (2011)
-
Roughly weighted hierarchical simple games
Hameed, Ali, (2015)
- More ...