The kernel is in the least core for permutation games
From MaRDI portal
Publication:302128
DOI10.1007/S10100-014-0342-YzbMATH Open1339.91014OpenAlexW2043443830MaRDI QIDQ302128FDOQ302128
Authors: Tamás Solymosi
Publication date: 4 July 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: http://econ.core.hu/file/download/mtdp/MTDP1402.pdf
Recommendations
Cites Work
- The Nucleolus of a Characteristic Function Game
- The assignment game. I: The core
- The kernel and bargaining set for convex games
- Introduction to the Theory of Cooperative Games
- The kernel of a cooperative game
- Existence of stable payoff configurations for cooperative games
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- The bargaining set of four-person balanced games
- Bargaining sets and the core in permutation games
- A note on the inclusion of the kernel in the core of the bilateral assignment game
- On one-sided versus two-sided matching games
- The pre-kernel as a tractable solution for cooperative games. An exercise in algorithmic game theory
- On Some Network Flow Games
- Title not available (Why is that?)
- The reactive bargaining set for cooperative games
- The Kernel of the General-Sum Four-Person Game
- Computing the nucleolus of cyclic permutation games
- Permutation games: Another class of totally balanced 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)