Related references
Note: Only part of the references are listed.The Matching Polytope has Exponential Extension Complexity
Thomas Rothvoss
JOURNAL OF THE ACM (2017)
Computing solutions for matching games
Peter Biro et al.
INTERNATIONAL JOURNAL OF GAME THEORY (2012)
Finding nucleolus of flow game
Xiaotie Deng et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2009)
Computing an element in the lexicographic kernel of a game
Ulrich Faigle et al.
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2006)
The nucleolus of balanced simple flow networks
J Potters et al.
GAMES AND ECONOMIC BEHAVIOR (2006)
Strongly essential coalitions and the nucleolus of peer group games
R Brânzei et al.
INTERNATIONAL JOURNAL OF GAME THEORY (2005)
Matching games: The least core and the nucleolus
W Kern et al.
MATHEMATICS OF OPERATIONS RESEARCH (2003)
On the computation of the nucleolus of a cooperative game
U Faigle et al.
INTERNATIONAL JOURNAL OF GAME THEORY (2001)
Note on the computational complexity of least core concepts for min-cost spanning tree games
U Faigle et al.
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2000)
Computing the nucleolus of some combinatorially-structured games
J Kuipers et al.
MATHEMATICAL PROGRAMMING (2000)
Share Paper
