We study a family of interval catch digraph called proportional-edge proximity catch digraph (PCD) which is also a …

the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and … coalition. The hierarchical strength of a player in a coalition in an acyclic digraph is the number of admissible permutations … (those in which successors in the digraph enter before predecessors) where this player is the last of that coalition to enter …

the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and … coalition. The hierarchical strength of a player in a coalition in an acyclic digraph is the number of admissible permutations … (those in which successors in the digraph enter before predecessors) where this player is the last of that coalition to enter …

the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and … coalition. The hierarchical strength of a player in a coalition in an acyclic digraph is the number of admissible permutations … (those in which successors in the digraph enter before predecessors) where this player is the last of that coalition to enter …