A procedure for finding the nucleolus of a cooperativen person game

DOI10.1007/BF01919297zbMath0464.90093MaRDI QIDQ3916404

Irinel Dragan

Publication date: 1981

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

nucleolussequence of linear programscoalition arraycomputation of nucleoluscooperative \(n\)-person games with side paymentsminimal balanced set

Mathematics Subject Classification ID

Cooperative games (91A12) Linear programming (90C05) (n)-person games, (n>2) (91A06)

Related Items

On the lexicographic centre of multiple objective optimization ⋮ 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 ⋮ Selfish-dilemma consensus analysis for group decision making in the perspective of cooperative game theory ⋮ A note on the nonuniqueness of the equal profit method ⋮ Finding the nucleolus of the vehicle routing game with time windows ⋮ Consolidation in Urban Freight Transportation — Cost Allocation Models ⋮ Analytic solution for the nucleolus of a three-player cooperative game ⋮ The Complexity of the Nucleolus in Compact Games ⋮ Incitements for transportation collaboration by cost allocation ⋮ A heuristic procedure for computing the nucleolus

Cites Work

• Unnamed Item
• Unnamed Item
• Iterative processes with nucleolar restrictions
• Convergent Transfer Schemes for N-Person Games
• The Nucleolus of a Characteristic Function Game
• On the Nucleolus of a Characteristic Function Game