The kernel is in the least core for permutation games
From MaRDI portal
(Redirected from Publication:302128)
Recommendations
Cites work
- scientific article; zbMATH DE number 3997573 (Why is no real title available?)
- A note on the inclusion of the kernel in the core of the bilateral assignment game
- Bargaining sets and the core in permutation games
- Computing the nucleolus of cyclic permutation games
- Existence of stable payoff configurations for cooperative games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Introduction to the Theory of Cooperative Games
- On Some Network Flow Games
- On one-sided versus two-sided matching games
- Permutation games: Another class of totally balanced games
- The Kernel of the General-Sum Four-Person Game
- The Nucleolus of a Characteristic Function Game
- The assignment game. I: The core
- The bargaining set of four-person balanced games
- The kernel and bargaining set for convex games
- The kernel of a cooperative game
- The pre-kernel as a tractable solution for cooperative games. An exercise in algorithmic game theory
- The reactive bargaining set for cooperative games
Cited in
(4)
This page was built for publication: The kernel is in the least core for permutation games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q302128)