Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory
From MaRDI portal
Publication:1278742
DOI10.1016/0377-2217(95)00341-XzbMath0917.90296MaRDI QIDQ1278742
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Constructive and blocking power in collaborative transportation, Finding the nucleoli of large cooperative games, Optimal coalition formation and surplus distribution: two sides of one coin, Characterization sets for the nucleolus in balanced games, Finding the nucleolus of the vehicle routing game with time windows, Common mistakes in computing the nucleolus, A review on cost allocation methods in collaborative transportation, The least square B-nucleolus for fuzzy cooperative games, Analytic solution for the nucleolus of a three-player cooperative game, Fast computation of the leastcore and prenucleolus of cooperative games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finding the nucleolus of an \(n\)-person cooperative game
- A simplex based algorithm for the lexicographically extended linear maxmin problem
- The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
- The nucleolus of homogeneous games with steps
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- The Nucleolus of a Matrix Game and Other Nucleoli
- Lexikographische Optimierung und Zweipersonennullsummenspiele unter Ausnutzung von Fehlern des Gegners
- Lexicographic quasiconcave multiobjective programming
- The Nucleolus of a Characteristic Function Game
- The Nucleolus as a Solution of a Minimization Problem