Power in threshold network flow games

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Autonomous Agents and Multi-Agent Systems

• Publication date

  2009-02-01

• Fields of study

  Computer Science, Political Science

• Identifiers
  DOI 10.1007/s10458-008-9057-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Algorithmic Mechanism Design

  2008cited by this paper
• Computing the Banzhaf power index in network flow games

  2007cited by this paper
• A randomized method for the shapley value for the voting game

  2007cited by this paper
• Junta distributions and the average-case complexity of manipulating elections

  2006cited by this paper
• Anyone but him: The complexity of precluding an alternative

  2005cited by this paper
• Core Stability of Flow Games

  2005cited by this paper
• Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains

  2004cited by this paper
• Computing Power Indices for Large Voting Games

  2003cited by this paper
• Complexity of determining nonemptiness of the core

  2003cited by this paper
• Voting Power in the Governance of the International Monetary Fund

  2002cited by this paper
• NP-completeness for calculating power indices of weighted majority games

  2001cited by this paper
• Designing networks for selfish users is hard

  2001cited by this paper
• The Treaty of Nice and qualified majority voting

  2001cited by this paper
• Generating functions for computing power indices efficiently

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

  2000cited by this paper
• Cooperative Games on Combinatorial Structures

  2000cited by this paper
• ON THE CHOICE OF A POWER INDEX

  1999cited by this paper
• Voting for movies: the anatomy of a recommender system

  1999cited by this paper
• A Heuristic Technique for Multiagent PlanningEithan

  1997cited by this paper
• Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework

  1997cited by this paper
• A heuristic technique for multi‐agent planning

  1997cited by this paper
• An automated meeting scheduling system that utilizes user preferences

  1997cited by this paper
• The economic approach to artificial intelligence

  1995cited by this paper
• A Course in Game Theory

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

  1994cited by this paper
• The Clarke Tax as a Consensus Mechanism Among Automated Agents

  1991cited by this paper
• A Value for n-person Games

  1988influential reference
• Deals Among Rational Agents

  1985cited by this paper
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

  1983cited by this paper
• Totally Balanced Games and Games of Flow

  1982cited by this paper
• Generalized Network Problems Yielding Totally Balanced Games

  1982cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• The Complexity of Enumeration and Reliability Problems

  1979influential reference
• Mathematical Properties of the Banzhaf Power Index

  1979cited by this paper
• The Directed Subgraph Homeomorphism Problem

  1978cited by this paper
• Homogeneity, independence, and power indices

  1977cited by this paper
• Multilinear extensions and the banzhaf value

  1975cited by this paper
• Flows in Networks

  1963cited by this paper
• VALUES OF LARGE GAMES. 6: EVALUATING THE ELECTORAL COLLEGE EXACTLY

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

  1954cited by this paper
• Contributions to the theory of games

  1953cited by this paper
• 17. A Value for n-Person Games

  1953cited by this paper

• InfluenceNet: AI Models for Banzhaf and Shapley Value Prediction

  2025cites this paper
• Complexity of Computing the Shapley Value in Partition Function Form Games

  2023cites this paper
• THeory and Evidence to Measure Influence in Social structures (THEMIS)

  2023cites this paper
• Answers set programs for non-transferable utility games: Expressiveness, complexity and applications

  2022cites this paper
• Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions

  2020cites this paper
• Negotiating team formation using deep reinforcement learning

  2020cites this paper
• Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value

  2020cites this paper
• Complexity of Computing the Shapley Value in Games with Externalities

  2019cites this paper
• Explicit flow-risk allocation for cooperative maximum flow problems under interval uncertainty

  2019cites this paper
• Computing Stable Solutions in Threshold Network Flow Games With Bounded Treewidth

  2019cites this paper
• Explicit flow-risk allocation for cooperative maximum flow problems under interval uncertainty

  2019cites this paper
• On the Shapley value and its application to the Italian VQR research assessment exercise

  2019cites this paper
• Partition decision trees: representation for efficient computation of the Shapley value extended to games with externalities

  2019cites this paper
• Flow Allocation Games

  2019cites this paper
• Effective Heuristics for Committee Scoring Rules

  2018cites this paper
• Approximation of Banzhaf indices and its application to voting games

  2018cites this paper
• Bitcoin Mining: A Game Theoretic Analysis

  2018cites this paper
• Aspects of Opinion aggregation : and its Application to Elections, Cryptocurrency, and Graphical Models (כותר נוסף בעברית: היבטים בצבירת דעות : ויישומם בבחירות, במטבעות מבוזרים ובמודלים גרפיים)

  2018cites this paper
• 2 1 N ov 2 01 7 Cooperative Games with Bounded Dependency Degree

  2017cites this paper
• The Tractability of the Shapley Value over Bounded Treewidth Matching Games

  2017cites this paper
• Cooperative Games with Bounded Dependency Degree

  2017cites this paper
• Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program

  2017cites this paper
• Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game

  2017cites this paper
• Beyond Intractability: A Computational Complexity Analysis of Various Types of Influence and Stability in Cooperative Games

  2016cites this paper
• Recherche de flots stables dans des réseaux de transport multi-agents

  2016cites this paper
• Constraint satisfaction: algorithms, complexity results, and applications

  2016cites this paper
• Path-Disruption Games: Bribery and a Probabilistic Model

  2016cites this paper
• Using Computational Intelligence Algorithms to Solve the Coalition Structure Generation Problem in Coalitional Skill Games

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

  2016cites this paper
• Structural Tractability of Shapley and Banzhaf Values in Allocation Games

  2015cites this paper
• Bitcoin Mining Pools: A Cooperative Game Theoretic Analysis

  2015cites this paper
• Forms of representation for simple games: Sizes, conversions and equivalences

  2015cites this paper
• Efficient Computation of Semivalues for Game-Theoretic Network Centrality

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

  2015cites this paper
• Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division

  2015cites this paper
• Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality

  2014cites this paper
• Cooperative weakest link games

  2014cites this paper
• The shared assignment game and applications to pricing in cloud computing

  2014cites this paper
• On the Structure of Synergies in Cooperative Games

  2014cites this paper
• A Centrality Measure for Networks With Community Structure Based on a Generalization of the Owen Value

  2014cites this paper
• Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Verifiable Settings

  2014cites this paper
• Cooperative Product Games

  2014cites this paper
• False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time

  2013cites this paper
• Optimal Coalition Structure Generation in Cooperative Graph Games

  2013cites this paper
• Sharing Rewards in Cooperative Connectivity Games

  2013cites this paper
• Coalitional Games via Network Flows

  2013cites this paper
• Shortest path games

  2013cites this paper
• Computational Coalition Formation

  2013cites this paper
• Cooperative games and multiagent systems

  2013cites this paper
• Reliability Weighted Voting Games

  2013cites this paper
• Computing cooperative solution concepts in coalitional skill games

  2013cites this paper
• Power indices of influence games and new centrality measures for social networks

  2013cites this paper
• Crowd IQ: aggregating opinions to boost performance

  2012cites this paper
• Optimal Coalition Structures in Cooperative Graph Games

  2011cites this paper
• Algorithmic Decision Theory: Second International Conference, ADT 2011, Piscataway, NJ, USA, October 26-28, 2011. Proceedings

  2011cites this paper
• Bribery in Path-Disruption Games

  2011cites this paper
• Graph-based coalitional games: an analysis via characteristics

  2011influential citation
• Complexity of coalition structure generation

  2011cites this paper
• Solving Cooperative Reliability Games

  2011cites this paper
• Computational Aspects of Cooperative Game Theory

  2011cites this paper
• The Least-Core of Threshold Network Flow Games

  2011cites this paper
• Cooperative Solution Concepts in Coalitional Skill Games

  2010cites this paper
• The Good, The Bad and The Cautious: Safety Level Cooperative Games

  2010cites this paper
• Path disruption games

  2010cites this paper
• Shortest Path Games: Computational Complexity of Solution Concepts

  2010cites this paper
• Efficient Computation of the Shapley Value for Centrality in Networks

  2010cites this paper
• Monotone cooperative games and their threshold versions

  2010cites this paper
• Minimal Subsidies in Expense Sharing Games

  2010cites this paper
• Proof systems and transformation games

  2010cites this paper
• Merging and Splitting for Power Indices in Weighted Voting Games and Network Flow Games on Hypergraphs

  2010cites this paper
• Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games

  2010cites this paper
• The Cost of Stability in Network Flow Games

  2009cites this paper
• Spanning connectivity games

  2009cites this paper
• Lecture 10 Non-Transferable Utility Games

  year unknowncites this paper