A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Joint Conference on Artificial Intelligence

• Publication date

  2015-07-25

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Defeating Terrorist Networks with Game Theory

  2015cited by this paper
• Defeating Terrorist Networks with Game Theory

  2015cited by this paper
• Algorithms for the shapley and myerson values in graph-restricted games

  2014cited by this paper
• What is Theoretical Computer Science

  2014cited by this paper
• The cost of principles: analyzing power in compatibility weighted voting games

  2014cited by this paper
• Computational Analysis of Connectivity Games with Applications to the Investigation of Terrorist Networks

  2013cited by this paper
• Monotonicity of power in weighted voting games with restricted communication

  2012cited by this paper
• Computational Aspects of Cooperative Game Theory

  2011cited by this paper
• Subsidies, Stability, and Restricted Cooperation in Coalitional Games

  2011cited by this paper
• Game theory.

  2011cited by this paper
• Power Indices in Spanning Connectivity Games

  2009cited by this paper
• On the computational complexity of weighted voting games

  2009cited by this paper
• Reformulations of Some Power Indices in Weighted Voting Games

  2005cited by this paper
• Centrality and power in social networks: a game theoretic approach

  2003cited by this paper
• Annals of Mathematics and Artificial Intelligence

  2002cited by this paper
• Generating Functions for Computing the Myerson Value

  2002cited by this paper
• A SURVEY OF ALGORITHMS FOR CALCULATING POWER INDICES OF WEIGHTED MAJORITY GAMES

  2000cited by this paper
• On the Complexity of Cooperative Solution Concepts

  1994cited by this paper
• Treewidth: Computations and Approximations

  1994cited by this paper
• A linear time algorithm for finding tree-decompositions of small treewidth

  1993cited by this paper
• NP-completeness of some problems concerning voting games

  1990cited by this paper
• Values of graph-restricted games

  1986cited by this paper
• The Complexity of Computing the Permanent

  1979cited by this paper
• Mathematical Properties of the Banzhaf Power Index

  1979cited by this paper
• Mathematics of Operations Research.

  1978cited by this paper
• Graphs and Cooperation in Games

  1977cited by this paper
• A Method for Evaluating the Distribution of Power in a Committee System

  1954cited by this paper
• Applied Statistics. A Journal of the Royal Statistical Society

  1952cited by this paper
• The Elementary Statistics of Majority Voting

  1946cited by this paper

• THE COMPLEXITY OF POWER INDICES IN VOTING GAMES WITH INCOMPATIBLE PLAYERS

  2023cites this paper
• Voting power on a graph connected political space with an application to decision-making in the Council of the European Union

  2021influential citation
• Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value

  2020cites this paper
• Signed Graph Games: Coalitional Games with Friends, Enemies and Allies

  2020cites this paper
• Attachment centrality: Measure for connectivity in networks

  2019cites this paper
• Monte Carlo Techniques for Approximating the Myerson Value - Theoretical and Empirical Analysis

  2019cites this paper
• Power values and framing in game theory

  2018cites this paper
• Game-theoretic Network Centrality: A Review

  2017cites this paper
• Game-theoretic network centrality

  2017cites this paper
• Efficient algorithms for game-theoretic betweenness centrality

  2016cites this paper
• Fast Algorithms for Game-Theoretic Centrality Measures

  2015cites this paper