Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach
From MaRDI portal
Publication:1905053
DOI10.1007/BF01243038zbMath0841.90132OpenAlexW2044003167MaRDI QIDQ1905053
Reidun Helming, Asa Hallefjord, Kurt O. Jørnsten
Publication date: 4 February 1996
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01243038
Related Items (9)
Common mistakes in computing the nucleolus ⋮ Finding the nucleolus of any \(n\)-person cooperative game by a single linear program ⋮ Approximate nucleolus-based revenue sharing in airline alliances ⋮ Information sharing in DEA: a cooperative game theory approach ⋮ Finding the nucleolus of the vehicle routing game with time windows ⋮ Algorithmic Cost Allocation Games: Theory and Applications ⋮ Fast computation of the leastcore and prenucleolus of cooperative games ⋮ A heuristic procedure for computing the nucleolus ⋮ Fair ticket pricing in public transport as a constrained cost allocation game
Cites Work
- The propensity to disrupt and the disruption nucleolus of a characteristic function game
- A Linear Programming Approach to the Cutting-Stock Problem
- A generalized linear production model: A unifying model
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- A procedure for finding the nucleolus of a cooperativen person game
- On the core of linear production games
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- The Nucleolus of a Characteristic Function Game
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach