Computing the least-core and nucleolus for threshold cardinality matching games
From MaRDI portal
Publication:897924
DOI10.1016/j.tcs.2015.11.015zbMath1334.91009OpenAlexW292175297MaRDI QIDQ897924
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.015
Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43)
Related Items (3)
Path cooperative games ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ A heuristic procedure for computing the nucleolus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- Computing solutions for matching games
- The nucleolus of balanced simple flow networks
- Matching theory
- Geometric algorithms and combinatorial optimization
- An algorithm for finding the nucleolus of assignment games
- On the complexity of testing membership in the core of min-cost spanning tree games
- On computational complexity of membership test in flow games and linear production games
- The kernel/nucleolus of a standard tree game
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- The assignment game. I: The core
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- On the Complexity of Cooperative Solution Concepts
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Algorithmic Game Theory
- The Nucleolus of a Characteristic Function Game
- Matching Games: The Least Core and the Nucleolus
- Finding nucleolus of flow game
This page was built for publication: Computing the least-core and nucleolus for threshold cardinality matching games
