Hierarchical Simple Games: Representations and Weightedness

Details Hierarchical Simple Games: Representations and Weightedness Hierarchical Simple Games: Representations and Weightedness

2011-03-13

arxiv.org/abs/1103.2487v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Hierarchical Simple Games: Representations and Weightedness does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hierarchical Simple Games: Representations and Weightedness, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchical Simple Games: Representations and Weightedness will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233450