The pre-kernel as a tractable solution for cooperative games : an exercise in algorithmic game theory
著者
書誌事項
The pre-kernel as a tractable solution for cooperative games : an exercise in algorithmic game theory
（Theory and decision library, C . Game theory,
Springer, c2014
大学図書館所蔵 件 / 全10件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. 231-233
Includes indexes
内容説明・目次
内容説明
This 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.
目次
Introduction.- Some Solution Schemes and Game Properties.- The Shapley Value and (Pre-Kernel) as a Fairness Concept.- Fair Division in Cournot Markets.- Some Preliminary Results.- A Pre-Kernel Characterization and Orthogonal Projection.- Characterization of the Pre-Kernel by Solution Sets.- Algorithms for Computing the Pre-Kernel.- An Upper Dimension Bound of the Pre-Kernel.- Concluding Remarks.
「Nielsen BookData」 より