1 citations · 1 across the 6 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
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…
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…
cs.GT2015
The Incorrect Usage of Propositional Logic in Game Theory: The Case of Disproving Oneself
Holger Ingmar Meinhardt
Recently, we had to realize that more and more game theoretical articles have been published in peer-reviewed journals with severe logical deficiencies. In particular, we observed…