Common mistakes in computing the nucleolus

dc.contributor.author	Guajardo, Mario
dc.contributor.author	Jörnsten, Kurt
dc.date.accessioned	2014-05-14T07:30:45Z
dc.date.available	2014-05-14T07:30:45Z
dc.date.issued	2014-04
dc.identifier.issn	1500-4066
dc.identifier.uri	http://hdl.handle.net/11250/194983
dc.description.abstract	Despite linear programming and duality have correctly been incorporated in algorithms to compute the nucleolus, we have found mistakes in how these have been used in a broad range of applications. Overlooking the fact that a linear program can have multiple optimal solutions and neglecting the relevance of duality appear to be crucial sources of mistakes in computing the nucleolus. We discuss these issues and illustrate them in mistaken examples collected from a variety of literature sources. The purpose of this note is to prevent these mistakes propagate longer by clarifying how linear programming and duality can be correctly used for computing the nucleolus.	nb_NO
dc.language.iso	eng	nb_NO
dc.publisher	FOR	nb_NO
dc.relation.ispartofseries	Discussion paper;15/14
dc.subject	game theory	nb_NO
dc.subject	nucleolus	nb_NO
dc.subject	cost allocation	nb_NO
dc.subject	linear programming	nb_NO
dc.subject	duality	nb_NO
dc.title	Common mistakes in computing the nucleolus	nb_NO
dc.type	Working paper	nb_NO