The Nucleolus as a Solution of a Minimization Problem
Author:
- Elon KohlbergEKElon Kohlberg
- 1 July 1972
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 23 (1) , 34-39
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.Keywords
This publication has 3 references indexed in Scilit:
- Some recent results inn-person game theoryMathematical Programming, 1971
- On the Nucleolus of a Characteristic Function GameSIAM Journal on Applied Mathematics, 1971
- The Nucleolus of a Characteristic Function GameSIAM Journal on Applied Mathematics, 1969