Holger Ingmar Meinhardt

According to our database, Holger Ingmar Meinhardt authored at least 9 papers between 2001 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Polynomial-Time Algorithms for Computing the Nucleolus: An Assessment.

Holger Ingmar Meinhardt

CoRR, November, 2025

2019

Deduction Theorem: The Problematic Nature of Common Practice in Game Theory.

Holger Ingmar Meinhardt

CoRR, 2019

2016

Finding the Nucleoli of Large Cooperative Games: A Disproof with Counter-Example.

Holger Ingmar Meinhardt

CoRR, 2016

2015

The Incorrect Usage of Propositional Logic in Game Theory: The Case of Disproving Oneself.

Holger Ingmar Meinhardt

CoRR, 2015

2010

On the Supermodularity of Homogeneous Oligopoly Games.

Theo S. H. Driessen, Holger Ingmar Meinhardt

IGTR, 2010

2007

Non-binding agreements and fairness in commons dilemma games.

Axel Ostmann, Holger Ingmar Meinhardt

Central Eur. J. Oper. Res., 2007

2006

An LP approach to compute the pre-kernel for cooperative games.

Holger Ingmar Meinhardt

Comput. Oper. Res., 2006

2005

Convexity of oligopoly games without transferable technologies.

Theo S. H. Driessen, Holger Ingmar Meinhardt

Math. Soc. Sci., 2005

2001

(Average-) convexity of Common Pool and Oligopoly TU-Games.

Theo S. H. Driessen, Holger Ingmar Meinhardt

IGTR, 2001