On the Complexity of Cooperative Solution Concepts
From MaRDI portal
Publication:4302588
DOI10.1287/moor.19.2.257zbMath0824.90146OpenAlexW2046116913MaRDI QIDQ4302588
Xiaotie Deng, Christos H. 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
Related Items (only showing first 100 items - show all)
Variance allocation and Shapley value ⋮ On the axiomatic approach to sharing the revenues from broadcasting sports leagues ⋮ Generating Empirical Core Size Distributions of Hedonic Games Using a Monte Carlo Method ⋮ COALITION FORMATION GAMES: A SURVEY ⋮ Complexity of core allocation for the bin packing game ⋮ Reasoning about coalitional games ⋮ Efficient firm groups: allocative efficiency in cooperative games ⋮ A cooperative value in a multiplicative model ⋮ Cooperation through social influence ⋮ Characteristic function games with restricted agent interactions: core-stability and coalition structures ⋮ Networks, Communication and Hierarchy: Applications to Cooperative Games ⋮ Computing equilibria: a computational complexity perspective ⋮ A Note on the Owen Value for Glove Games ⋮ Coincidence of cooperative game theoretic solutions in the appointment problem ⋮ Compromising in bifocal distribution games: the average value ⋮ Values for cooperative games over graphs and games with inadmissible coalitions ⋮ The proportional Shapley value and applications ⋮ A linear approximation method for the Shapley value ⋮ Improving polynomial estimation of the Shapley value by stratified random sampling with optimum allocation ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ Proof systems and transformation games ⋮ Game theoretic approach for fertilizer application: looking for the propensity to cooperate ⋮ \(k\)-additive upper approximation of TU-games ⋮ Assessing systematic sampling in estimating the Banzhaf-Owen value ⋮ Clique games: a family of games with coincidence between the nucleolus and the Shapley value ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ A cooperative game-theoretic approach to the social ridesharing problem ⋮ Efficient computation of the Shapley value for large-scale linear production games ⋮ Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability ⋮ Computational complexity of a solution for directed graph cooperative games ⋮ Additively separable hedonic games with social context ⋮ The degree measure as utility function over positions in graphs and digraphs ⋮ On the Shapley value of liability games ⋮ Growth of dimension in complete simple games ⋮ Generalized additive games ⋮ On stratified sampling for estimating coalitional values ⋮ Recent developments in the queueing problem ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ The complexity of power indexes with graph restricted coalitions ⋮ Coalition structure generation: a survey ⋮ Manipulating the quota in weighted voting games ⋮ The graph energy game ⋮ Information-sharing in social networks ⋮ A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ On the complexity of core, kernel, and bargaining set ⋮ Selfish bin covering ⋮ Fair cost allocations under conflicts - a game-theoretic point of view - ⋮ Computation of the random arrival rule for bankruptcy problems ⋮ A general characterization for non-balanced games in terms of \(U\)-cycles ⋮ Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games ⋮ Analyzing power in weighted voting games with super-increasing weights ⋮ On the computational complexity of coalitional resource games ⋮ Complexity of constructing solutions in the core based on synergies among coalitions ⋮ Coalition formation in social environments with logic-based agents1 ⋮ Hodge decomposition and the Shapley value of a cooperative game ⋮ Computing cooperative solution concepts in coalitional skill games ⋮ Sampling methods to estimate the Banzhaf-Owen value ⋮ Unnamed Item ⋮ Polynomial calculation of the Shapley value based on sampling ⋮ Computability of simple games: A characterization and application to the core ⋮ On complexity of single-minded auction ⋮ Algorithms for core stability, core largeness, exactness, and extendability of flow games ⋮ On the computational complexity of weighted voting games ⋮ Solving coalitional resource games ⋮ Unnamed Item ⋮ Path cooperative games ⋮ The \(cg\)-position value for games on fuzzy communication structures ⋮ The complexity of power-index comparison ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ On the coincidence of the prenucleolus and the Shapley value ⋮ Network strength games: the core and the nucleolus ⋮ Total balancedness condition for Steiner tree games. ⋮ Marginal contribution, reciprocity and equity in segregated groups: bounded rationality and self-organization in social networks ⋮ Analyzing Power in Weighted Voting Games with Super-Increasing Weights ⋮ A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications ⋮ Effort Games and the Price of Myopia ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ The Complexity of the Nucleolus in Compact Games ⋮ Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations ⋮ Dynamics of Profit-Sharing Games ⋮ Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games ⋮ Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games ⋮ Traveling salesman games with the Monge property ⋮ Cooperative games with overlapping coalitions: charting the tractability frontier ⋮ SOME OPEN PROBLEMS IN SIMPLE GAMES ⋮ Monte Carlo methods for the Shapley-Shubik power index ⋮ \(w\)-density and \(w\)-balanced property of weighted graphs ⋮ COALITIONAL BELIEFS IN COURNOT OLIGOPOLY TU GAMES ⋮ On Pareto optimality in social distance games ⋮ Measuring power in coalitional games with friends, enemies and allies ⋮ Structural control in weighted voting games ⋮ Some anomalies of farsighted strategic behavior ⋮ Universally balanced combinatorial optimization games ⋮ Explanation with the winter value: efficient computation for hierarchical Choquet integrals ⋮ Condorcet winners for public goods ⋮ Computing Shapley values in the plane
This page was built for publication: On the Complexity of Cooperative Solution Concepts
