1 citations · 1 across the 6 of their papers we have counts for
6 papers
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…
Deduction Theorem: The Problematic Nature of Common Practice in Game Theory
Holger I. Meinhardt
We consider the Deduction Theorem used in the literature of game theory to run a purported proof by contradiction. In the context of game theory, it is stated that if we have a pro…
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…
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…
On the Single-Valuedness of the Pre-Kernel
Holger Ingmar Meinhardt
Based on results given in the recent book by Meinhardt (2013), which presents a dual characterization of the pre-kernel by a finite union of solution sets of a family of quadratic…
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…