Computing the nucleolus of weighted cooperative matching games in polynomial time
From MaRDI portal
DOI10.1007/s10107-020-01483-4zbMath1450.90044arXiv1803.03249OpenAlexW2790916376MaRDI QIDQ5918923
Kanstantsin Pashkovich, Justin Toth, Jochen Könemann
Publication date: 28 August 2020
Published in: Mathematical Programming. Series A. Series B, Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03249
Related Items (6)
Population monotonicity in matching games ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Arboricity games: the core and the nucleolus ⋮ Simple games versus weighted voting games: bounding the critical threshold value ⋮ The general graph matching game: approximate core ⋮ On the population monotonicity of independent set games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing solutions for matching games
- The nucleolus of balanced simple flow networks
- Game theoretic analysis of a bankruptcy problem from the Talmud
- Geometric algorithms and combinatorial optimization
- The nucleon of cooperative games and an algorithm for matching games
- An algorithm for finding the nucleolus of assignment games
- Note on the computational complexity of least core concepts for min-cost spanning tree games.
- Stable outcomes of the roommate game with transferable utility
- On the computation of the nucleolus of a cooperative game
- Computing the nucleolus of some combinatorially-structured games.
- The kernel/nucleolus of a standard tree game
- Characterization sets for the nucleolus
- Computing the nucleolus of min-cost spanning tree games is NP-hard.
- On the computational complexity of weighted voting games
- Computing an element in the lexicographic kernel of a game
- The assignment game. I: The core
- Strongly essential coalitions and the nucleolus of peer group games
- Network Bargaining with General Capacities
- The Bargaining Problem
- Iterative Methods in Combinatorial Optimization
- Assignment Problems and the Location of Economic Activities
- Algorithmic Cooperative Game Theory
- The Cooperative Game Theory Foundations of Network Bargaining Games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- The Matching Polytope has Exponential Extension Complexity
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- Convergent Transfer Schemes for N-Person Games
- The Nucleolus of a Characteristic Function Game
- The kernel of a cooperative game
- Matching Games: The Least Core and the Nucleolus
- Finding nucleolus of flow game
- College Admissions and the Stability of Marriage
This page was built for publication: Computing the nucleolus of weighted cooperative matching games in polynomial time
