3 papers
cs.GT2025
Polynomial-Time Algorithms for Computing the Nucleolus: An Assessment
Holger I. Meinhardt
Recently, Maggiorano et al. (2025) claimed that they have developed a strongly polynomial-time combinatorial algorithm for the nucleolus in convex games that is based on the reduce…
math.OC2017
Simplifying the Kohlberg Criterion on the Nucleolus: A Correct Approach
Holger Ingmar Meinhardt
Nguyen (2016, 2017) claimed that he has developed a simplifying set of the Kohlberg criteria that involves checking the balancedness of at most sets of coalitions. This cla…
cs.GT2016
Finding the Nucleoli of Large Cooperative Games: A Disproof with Counter-Example
Holger Ingmar Meinhardt
Nguyen and Thomas (2016) claimed that they have found a method to compute the nucleoli of games with more than players using nested linear programs (LP). Unfortunately, this c…