000			01930nam a2200253Ia 4500
003			OSt
005			20250714161122.0
008			220909b |||||||| |||| 00| 0 eng d
020			_a9783642395482
037			_cTextbook
040			_aCSL _beng _cCSL
041			_aeng
084			_aB2891 Q4 TOR _qCSL
100			_aMeinhardt, Holger Ingmar _eauthor _9815576
245		0	_aPre-kernel as a tractable solutions for cooperative games: An exercise in algorithmic game theory _c/ by Holger Ingmar Meinhardt
260			_aNew York : _bSpringer, _c2014.
300			_axxxiii, 242p. _b: ill.
500			_aBibliography 231-234p.; Index 235-242p.
520			_aThis present book provides an alternative approach to study the pre-kernel solution of transferable utility games based on a generalized conjugation theory from convex analysis. Although the pre-kernel solution possesses an appealing axiomatic foundation that lets one consider this solution concept as a standard of fairness, the pre-kernel and its related solutions are regarded as obscure and too technically complex to be treated as a real alternative to the Shapley value. Comprehensible and efficient computability is widely regarded as a desirable feature to qualify a solution concept apart from its axiomatic foundation as a standard of fairness. We review and then improve an approach to compute the pre-kernel of a cooperative game by the indirect function. The indirect function is known as the Fenchel-Moreau conjugation of the characteristic function. Extending the approach with the indirect function, we are able to characterize the pre-kernel of the grand coalition simply by the solution sets of a family of quadratic objective functions.
650			_a Concluding remarks _9815577
650			_aSome preliminary results _9815578
942			_hB2891 Q4 TOR _cTB _2CC _n0
999			_c14665 _d14665