The fairest core in cooperative games with transferable utilities
From MaRDI portal
Publication:1785318
DOI10.1016/j.orl.2014.11.001zbMath1408.91016OpenAlexW2002061079MaRDI QIDQ1785318
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/369712/1/__soton.ac.uk_ude_PersonalFiles_Users_tn6g10_mydocuments_Data_Research_game%2520theory_fairest_core_documentation_The_Fairest_Core.pdf
Related Items (2)
The family of ideal values for cooperative games ⋮ Associated games to optimize the core of a transferable utility game
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Geometric algorithms and combinatorial optimization.
- Cooperative game theoretic centrality analysis of terrorist networks: the cases of Jemaah Islamiyah and Al Qaeda
- Cores of convex games
- On the core and nucleolus of minimum cost spanning tree games
- The polynomial solvability of convex quadratic programming
- Column Generation
This page was built for publication: The fairest core in cooperative games with transferable utilities