Power Indices in Spanning Connectivity Games

DOI10.1007/978-3-642-02158-9_7zbMath1246.91009MaRDI QIDQ3638444

Oded Lachish, Rahul Savani, Haris Aziz, Mike S. Paterson

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_7

zbMATH Keywords

coalitional games; network connectivity; Shapley-Shubik index; Banzhaf index

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91A12: Cooperative games

91A43: Games involving graphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Proof systems and transformation games, Computing cooperative solution concepts in coalitional skill games, Forms of representation for simple games: sizes, conversions and equivalences, Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases, Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Control and voting power in corporate networks: Concepts and computational aspects
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• A new index of power for simple n-person games
• Operations research games: A survey. (With comments and rejoinder)
• Determinants of matrices related to the Pascal triangle
• Spanning network games.
• Monotonic games are spanning network games
• Network analysis. Methodological foundations.
• Combinatorial optimization. Theory and applications.
• The Complexity of Power-Index Comparison
• Computational Complexity of Network Reliability Analysis: An Overview
• Complexity of Finding Embeddings in a k-Tree
• The Complexity of Enumeration and Reliability Problems
• Mathematical Properties of the Banzhaf Power Index