Weightedness and structural characterization of hierarchical simple games

DOI10.1016/J.MATHSOCSCI.2012.11.007MaRDI QIDQ1950240zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Tatiana Gvozdeva, Ali Hameed, Arkadii Slinko

Publication date 10 May 2013

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.2487

Mathematics Subject Classification ID

Games involving graphs (91A43) Authentication, digital signatures and secret sharing (94A62)

Abstract: In many situations, both in human and artificial societies, cooperating agents have different status with respect to the activity and it is not uncommon that certain actions are only allowed to coalitions that satisfy certain criteria, e.g., to sufficiently large coalitions or coalitions which involve players of sufficient seniority. Simmons (1988) formalized this idea in the context of secret sharing schemes by defining the concept of a (disjunctive) hierarchical access structure. Tassa (2007) introduced their conjunctive counterpart. From the game theory perspective access structures in secret sharing schemes are simple games. In this paper we prove the duality between disjunctive and conjunctive hierarchical games. We introduce a canonical representation theorem for both types of hierarchical games and characterize disjunctive ones as complete games with a unique shift-maximal losing coalition. We give a short combinatorial proof of the Beimel-Tassa-Weinreb (2008) characterization of weighted disjunctive hierarchical games. By duality we get similar theorems for conjunctive hierarchical games.

Recommendations

• Roughly weighted hierarchical simple games
• On the characterization of weighted simple games
• A characterisation of ideal weighted secret sharing schemes
• Three hierarchies of simple games parameterized by ``resource parameters
• Weighted and roughly weighted simple games

Cited in

(10)

• Implementation of weighted values in hierarchical and horizontal cooperation structures
• Growth of dimension in complete simple games
• On the characterization of weighted simple games
• A general hierarchical graph model for conflict resolution with application to greenhouse gas emission disputes between USA and China
• Three hierarchies of simple games parameterized by ``resource parameters
• On the enumeration of Boolean functions with distinguished variables
• Roughly weighted hierarchical simple games
• Ideal hierarchical secret sharing and lattice path matroids
• Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
• A Basic Hierarchical Graph Model for Conflict Resolution with Application to Water Diversion Conflicts in China

This page was built for publication: Weightedness and structural characterization of hierarchical simple games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950240)