Fast computation of the leastcore and prenucleolus of cooperative games

DOI10.1051/ro:2008016zbMath1154.91317MaRDI QIDQ3598039

Matthieu A. André, Joseph Frédéric Bonnans

Publication date: 29 January 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105404

zbMATH Keywords

coalitions; cooperative games; decomposition; nucleolus; symmetric games; constraint generation; aggregate players; convex production games

Mathematics Subject Classification ID

90C11: Mixed integer programming

91A12: Cooperative games

90C05: Linear programming

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

Information sharing in DEA: a cooperative game theory approach, Finding the nucleolus of the vehicle routing game with time windows

Cites Work

• Unnamed Item
• Unnamed Item
• The general nucleolus and the reduced game property
• Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory
• Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach
• Linear Inequalities and Related Systems. (AM-38)
• The Cutting-Plane Method for Solving Convex Programs
• A generalized linear production model: A unifying model
• On the core of linear production games
• Coeur et nucléolus des jeux de recouvrement
• The Nucleolus of a Characteristic Function Game