Power Indices in Spanning Connectivity Games

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

Rahul Savani, Oded Lachish, 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 gamesnetwork connectivityShapley-Shubik indexBanzhaf index

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (10)

Proof systems and transformation games ⋮ 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 ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Social disruption games in signed networks ⋮ Collusion Attack from Hubs in The Blockchain Offline Channel Network ⋮ Computing cooperative solution concepts in coalitional skill games ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ Negotiating team formation using deep reinforcement learning ⋮ Measuring power in coalitional games with friends, enemies and allies

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

This page was built for publication: Power Indices in Spanning Connectivity Games