An LP approach to compute the pre-kernel for cooperative games
From MaRDI portal
Publication:2567178
Recommendations
Cites work
- A characterization, existence proof and dimension bounds for the kernel of a game
- A Method for Computing the Kernel of n-Person Games
- A problem of rights arbitration from the Talmud
- Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
- Cores of convex games
- Dual representation of cooperative games based on fenchel-moreau conjugation
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- scientific article; zbMATH DE number 1329109 (Why is no real title available?)
- scientific article; zbMATH DE number 1099365 (Why is no real title available?)
- The kernel of a cooperative game
- The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs
- The Nucleolus as a Solution of a Minimization Problem
- The Nucleolus of a Characteristic Function Game
- The Structure of the Kernel of a Cooperative Game
Cited in
(8)- Non-binding agreements and fairness in commons dilemma games
- (Pre)kernel catchers for cooperative games
- Computing an element in the lexicographic kernel of a game
- Convexity of oligopoly games without transferable technologies
- The pre-kernel as a tractable solution for cooperative games. An exercise in algorithmic game theory
- Construct the stable vendor managed inventory partnership through a profit-sharing approach
- The lexicogfraphic prekernel
- Social exchange networks with distant bargaining
This page was built for publication: An LP approach to compute the pre-kernel for cooperative games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567178)