On the Complexity of Cooperative Solution Concepts
From MaRDI portal
Publication:4302588
DOI10.1287/MOOR.19.2.257zbMATH Open0824.90146OpenAlexW2046116913MaRDI QIDQ4302588
Xiaotie Deng, Christos Papadimitriou
Publication date: 21 August 1994
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.19.2.257
Cited In (only showing first 100 items - show all)
- Algorithms for core stability, core largeness, exactness, and extendability of flow games
- Information-sharing in social networks
- Network strength games: the core and the nucleolus
- On the complexity of problems on simple games
- Effort Games and the Price of Myopia
- On the computational complexity of weighted voting games
- Some anomalies of farsighted strategic behavior
- On the computational complexity of coalitional resource games
- Complexity of core allocation for the bin packing game
- Variance allocation and Shapley value
- The proportional Shapley value and applications
- Analyzing Power in Weighted Voting Games with Super-Increasing Weights
- Computation of the random arrival rule for bankruptcy problems
- Title not available (Why is that?)
- The complexity of the nucleolus in compact games
- The complexity of power-index comparison
- Path cooperative games
- Efficient firm groups: allocative efficiency in cooperative games
- Traveling salesman games with the Monge property
- Computational complexity of a solution for directed graph cooperative games
- Computing the least-core and nucleolus for threshold cardinality matching games
- A cooperative value in a multiplicative model
- Measuring power in coalitional games with friends, enemies and allies
- Networks, Communication and Hierarchy: Applications to Cooperative Games
- Values for cooperative games over graphs and games with inadmissible coalitions
- Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation
- Cooperative Games
- On the complexity of testing membership in the core of min-cost spanning tree games
- Coincidence of cooperative game theoretic solutions in the appointment problem
- On complexity of single-minded auction
- Complexity of constructing solutions in the core based on synergies among coalitions
- Polynomial calculation of the Shapley value based on sampling
- Marginal contribution, reciprocity and equity in segregated groups: bounded rationality and self-organization in social networks
- Computability of simple games: A characterization and application to the core
- Structural control in weighted voting games
- The complexity of power indexes with graph restricted coalitions
- Compromising in bifocal distribution games: the average value
- Cooperation through social influence
- Solving coalitional resource games
- Finding nucleolus of flow game
- Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games
- A linear approximation method for the Shapley value
- Coalition structure generation: a survey
- Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
- A Note on the Owen Value for Glove Games
- On the coincidence of the prenucleolus and the Shapley value
- Proof systems and transformation games
- Growth of dimension in complete simple games
- Generalized additive games
- Universally balanced combinatorial optimization games
- Manipulating the quota in weighted voting games
- Computing cooperative solution concepts in coalitional skill games
- Condorcet winners for public goods
- A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
- Dynamics of Profit-Sharing Games
- Algorithms for computing the Shapley value of cooperative games on lattices
- Game theoretic approach for fertilizer application: looking for the propensity to cooperate
- Coalitional beliefs in Cournot oligopoly TU games
- \(w\)-density and \(w\)-balanced property of weighted graphs
- Fair cost allocations under conflicts - a game-theoretic point of view -
- The Computational Complexity of Understanding Binary Classifier Decisions
- On the complexity of core, kernel, and bargaining set
- Selfish bin covering
- COALITION FORMATION GAMES: A SURVEY
- Reasoning about coalitional games
- The Least-Core and Nucleolus of Path Cooperative Games
- A general characterization for non-balanced games in terms of \(U\)-cycles
- Computing equilibria: a computational complexity perspective
- Analyzing power in weighted voting games with super-increasing weights
- On Pareto optimality in social distance games
- Explanation with the winter value: efficient computation for hierarchical Choquet integrals
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
- Hodge decomposition and the Shapley value of a cooperative game
- Computing Shapley values in the plane
- Computational analysis of cooperative solutions in an education system
- Efficient Shapley performance attribution for least-squares regression
- On the axiomatic approach to sharing the revenues from broadcasting sports leagues
- Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games
- Complexity of computing the Shapley value in partition function form games
- Generating Empirical Core Size Distributions of Hedonic Games Using a Monte Carlo Method
- Variance reduced Shapley value estimation for trustworthy data valuation
- On the Shapley value of liability games
- The MaxIS-Shapley value in perfect graphs
- A comparative study of methods for estimating model-agnostic Shapley value explanations
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- Coalition formation in social environments with logic-based agents1
- Peer group situations and games with fuzzy uncertainty
- Minimal balanced collections and their application to core stability and other topics of game theory
- A cooperative game-theoretic approach to the social ridesharing problem
- \(k\)-additive upper approximation of TU-games
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis
- Title not available (Why is that?)
- Coreness of cooperative games with truncated submodular profit functions
- Assessing systematic sampling in estimating the Banzhaf-Owen value
- Social disruption games in signed networks
- Fast Approximation of the Shapley Values Based on Order-of-Addition Experimental Designs
- The graph energy game
- Some open problems in simple games
- Additively separable hedonic games with social context
This page was built for publication: On the Complexity of Cooperative Solution Concepts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302588)