On the Complexity of Cooperative Solution Concepts
From MaRDI portal
(Redirected from Publication:4302588)
Recommendations
- On the complexity of core, kernel, and bargaining set
- Algorithmic Cooperative Game Theory
- The complexity of the nucleolus in compact games
- Note on the computational complexity of least core concepts for min-cost spanning tree games.
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
Cited in
(only showing first 100 items - show all)- Asymmetric majority pillage games
- Bounds on the cost of stabilizing a cooperative game
- On Pareto optimality in social distance games
- Algorithms for core stability, core largeness, exactness, and extendability of flow games
- Coalition structure generation over graphs
- Explanation with the winter value: efficient computation for hierarchical Choquet integrals
- Information-sharing in social networks
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- Hard and easy \(k\)-typed compact coalitional games: the knowledge of player types marks the boundary
- Network strength games: the core and the nucleolus
- The computational complexity of understanding binary classifier decisions
- Algorithmic Cooperative Game Theory
- Effort Games and the Price of Myopia
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games
- On the complexity of problems on simple games
- On the computational complexity of weighted voting games
- Some anomalies of farsighted strategic behavior
- Hodge decomposition and the Shapley value of a cooperative game
- Computing Shapley values in the plane
- Degree centrality, von Neumann-Morgenstern expected utility and externalities in networks
- On the computational complexity of coalitional resource games
- Complexity of core allocation for the bin packing game
- Computational analysis of cooperative solutions in an education system
- Cost-sharing in parking games
- Variance allocation and Shapley value
- The proportional Shapley value and applications
- The complexity of egalitarian mechanisms for linear programming games
- On the axiomatic approach to sharing the revenues from broadcasting sports leagues
- Efficient Shapley performance attribution for least-squares regression
- scientific article; zbMATH DE number 25183 (Why is no real title available?)
- Computation of the random arrival rule for bankruptcy problems
- A solution concept related to ``bounded rationality for some two-echelon models
- Complexity of computing the Shapley value in partition function form games
- The complexity of the nucleolus in compact games
- The complexity of power-index comparison
- A note on the Owen value for glove games
- Path cooperative games
- Efficient firm groups: allocative efficiency in cooperative games
- Computational complexity of a solution for directed graph cooperative games
- Traveling salesman games with the Monge property
- Control by adding or deleting edges in graph-restricted weighted voting games
- On the Shapley value of liability games
- Computing the least-core and nucleolus for threshold cardinality matching games
- Variance reduced Shapley value estimation for trustworthy data valuation
- A cooperative value in a multiplicative model
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- How to compute von Neumann-Morgenstern solutions
- The MaxIS-Shapley value in perfect graphs
- Measuring power in coalitional games with friends, enemies and allies
- Two hardness results for Gamson's game
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- A comparative study of methods for estimating model-agnostic Shapley value explanations
- 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
- A cooperative game-theoretic approach to the social ridesharing problem
- 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
- Cooperative Games
- Coincidence of cooperative game theoretic solutions in the appointment problem
- On the complexity of testing membership in the core of min-cost spanning tree games
- On complexity of single-minded auction
- 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
- On the maximum coalition in limited cooperative game with many players
- \(k\)-additive upper approximation of TU-games
- Complexity of constructing solutions in the core based on synergies among coalitions
- Computability of simple games: A characterization and application to the core
- Structural control in weighted voting games
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis
- The complexity of power indexes with graph restricted coalitions
- Assessing systematic sampling in estimating the Banzhaf-Owen value
- Compromising in bifocal distribution games: the average value
- scientific article; zbMATH DE number 7625196 (Why is no real title available?)
- The graph energy game
- Social disruption games in signed networks
- Solving coalitional resource games
- Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games
- Some open problems in simple games
- Cooperation through social influence
- Fast Approximation of the Shapley Values Based on Order-of-Addition Experimental Designs
- ILP and CP models for normalized integer weighted voting game design problem
- Coalition structure generation: a survey
- Additively separable hedonic games with social context
- The degree measure as utility function over positions in graphs and digraphs
- A linear approximation method for the Shapley value
- Finding nucleolus of flow game
- The cg-position value for games on fuzzy communication structures
- Approximating the least core value and least core of cooperative games with supermodular costs
- Data debugging is NP-hard for classifiers trained with SGD
- On the coincidence of the prenucleolus and the Shapley value
- Analyzing the Zerkani network with the Owen value
- Strategyproof mechanisms for additively separable and fractional hedonic games
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- Proof systems and transformation games
- Growth of dimension in complete simple games
- Generalized additive games
- Manipulating the quota in weighted voting games
- Universally balanced combinatorial optimization games
- Computing cooperative solution concepts in coalitional skill games
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)
