The Nucleolus as a Solution of a Minimization Problem

Abstract

The following problem is discussed : Is it possible to represent the nucleolus of an n-person game as a solution of a linear programming problem? An affirmative answer is given for the case that the set of payoff vectors is a polytope. An example is described, showing that the above may not be possible when the set of payoff vectors is just convex and compact.