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

DOI10.1016/j.cor.2004.06.020zbMath1115.91006OpenAlexW1994371076MaRDI QIDQ2567178

Holger Ingmar Meinhardt

Publication date: 29 September 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.06.020

zbMATH Keywords

TU-gamespre-kernelzero-monotonic games

Mathematics Subject Classification ID

Cooperative games (91A12) Linear programming (90C05)

Related Items

Convexity of oligopoly games without transferable technologies ⋮ Non-binding agreements and fairness in commons dilemma games ⋮ Social exchange networks with distant bargaining ⋮ Construct the stable vendor managed inventory partnership through a profit-sharing approach

Cites Work

• Unnamed Item
• Unnamed Item
• A problem of rights arbitration from the Talmud
• The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
• Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
• A characterization, existence proof and dimension bounds for the kernel of a game
• Cores of convex games
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• Dual representation of cooperative games based on fenchel-moreau conjugation
• A Method for Computing the Kernel of n-Person Games
• The Structure of the Kernel of a Cooperative Game
• The Nucleolus of a Characteristic Function Game
• The kernel of a cooperative game
• The Nucleolus as a Solution of a Minimization Problem

This page was built for publication: An LP approach to compute the pre-kernel for cooperative games