In this paper we give structural charaterizations for disjunctive and conjunctive hierarchical simple games by characterizing them as complete games with a unique shift-maximal losing and, respectively, shift-minimal winning coalitions. We prove canonical representation theorems for both types of hierarchical games and establish duality between them. We characterize those disjunctive and conjunctive hierarchical games which 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.
Abstract. The goal of this paper is to introduce a new class of simplicial complexes that naturally generalize the threshold complexes. These will be derived from qualitative probability orders on subsets of a finite set that generalize subset orders induced by probability measures. We show that this new class strictly contains the threshold complexes and is strictly contained in the shifted complexes. We conjecture that this class of complexes is exactly the set of strongly acyclic complexes, a class that has previously appeared in the context of cooperative games. Beyond the results themselves, this new class of complexes allows us to refine our understanding of one-point extensions of a particular oriented matroid.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.