Computing the nucleolus by solving a prolonged simplex algorithm

Computing the nucleolus by solving a prolonged simplex algorithm

0.00 Avg rating0 Votes
Article ID: iaor20041116
Country: United States
Volume: 21
Issue: 3
Start Page Number: 757
End Page Number: 768
Publication Date: Aug 1996
Journal: Mathematics of Operations Research
Authors: , ,
Keywords: programming: linear
Abstract:

This paper describes a fast algorithm to find the nucleolus of any game with a nonempty imputation set. It is based on the algorithm scheme of Maschler et al. for the general nucleolus.

Reviews

Required fields are marked *. Your email address will not be published.