A procedure for finding the nucleolus of a cooperativen person game
From MaRDI portal
Publication:3916404
DOI10.1007/BF01919297zbMath0464.90093MaRDI QIDQ3916404
Publication date: 1981
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
nucleolus; sequence of linear programs; coalition array; computation of nucleolus; cooperative \(n\)-person games with side payments; minimal balanced set
Related Items
Consolidation in Urban Freight Transportation — Cost Allocation Models, On the lexicographic centre of multiple objective optimization, A note on the nonuniqueness of the equal profit method, Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach, On the nucleolus of the basic vehicle routing game, Approximate nucleolus-based revenue sharing in airline alliances, Finding the nucleolus of the vehicle routing game with time windows, Incitements for transportation collaboration by cost allocation, A heuristic procedure for computing the nucleolus, The Complexity of the Nucleolus in Compact Games, Analytic solution for the nucleolus of a three-player cooperative game
Cites Work