Matching Games: The Least Core and the Nucleolus
From MaRDI portal
Publication:5704127
DOI10.1287/moor.28.2.294.14477zbMath1082.91016OpenAlexW2029140075MaRDI QIDQ5704127
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/634/1/634.pdf
Cooperative games (91A12) Games involving graphs (91A43) Combinatorial optimization (90C27) (n)-person games, (n>2) (91A06)
Related Items (29)
Population monotonicity in matching games ⋮ The stable fixtures problem with payments ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ Characterization sets for the nucleolus in balanced games ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ Arboricity games: the core and the nucleolus ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ On the complexity of core, kernel, and bargaining set ⋮ Computing solutions for matching games ⋮ Finding nucleolus of flow game ⋮ Simple games versus weighted voting games: bounding the critical threshold value ⋮ Computing an element in the lexicographic kernel of a game ⋮ Efficient stabilization of cooperative matching games ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ The nucleolus of arborescence games in directed acyclic graphs ⋮ Path cooperative games ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ Network strength games: the core and the nucleolus ⋮ Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation ⋮ 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 ⋮ On core stability, vital coalitions, and extendability ⋮ The general graph matching game: approximate core ⋮ On the population monotonicity of independent set games ⋮ Computing the nucleolus of weighted voting games in pseudo-polynomial time
This page was built for publication: Matching Games: The Least Core and the Nucleolus
