The Harsanyi set for cooperative TU-games
نویسندگان
چکیده
A cooperative game with transferable utilities, or simply a TU-game, describes a situation in which players can obtain certain payo®s by cooperation. A solution mapping for these games is a mapping which assigns to every game a set of payo® distributions over the players in the game. Well-known solution mappings are the Core and the Weber set. In this paper we consider the mapping assigning to every game the Harsanyi set being the set of payo® vectors obtained by all possible distributions of the Harsanyi dividends of a coalition amongst its members. We discuss the structure and properties of this mapping and show how the Harsanyi set is related to the Core and Weber set. We also characterize the Harsanyi mapping as the unique mapping satisfying a set of six axioms. Finally we discuss some properties of the Harsanyi Imputation set, being the individally rational subset of the Harsanyi set.
منابع مشابه
Distributing dividends in games with ordered players
A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff vectors to every TU-game. Some solutions that are based on distributing dividends are the Shapley value (being the single-valued solution distributing the dividends equally am...
متن کاملThe Cooperative Solution of Stochastic Games
Building on the work of Nash, Harsanyi, and Shapley, we define a cooperative solution for strategic games that takes account of both the competitive and the cooperative aspects of such games. We prove existence in the general (NTU) case and uniqueness in the TU case. Our main result is an extension of the definition and the existence and uniqueness theorems to stochastic games discounted or und...
متن کاملHarsanyi power solutions for graph-restricted games
We consider cooperative transferable utility games, or simply TU-games, with limited communication structure in which players can cooperate if and only if they are connected in the communication graph. Solutions for such graph games can be obtained by applying standard solutions to a modified or restricted game that takes account of the cooperation restrictions. We discuss Harsanyi solutions wh...
متن کاملA Maschler Type Algorithm For Computing Multiweighted Shapley Values Of Cooperative Tu Games
In an earlier paper of the author, the Multiweighted Shapley Values (MWSVs) have been introduced as linear operators on the space of TU games, which satisfy the efficiency and the dummy player axioms. An early dynamic algorithm for computing the Shapley Value is due to late M.Maschler. In the present work, we present a similar algorithm for computing the Multiweighted Shapley Values. For differ...
متن کاملAxiomatic characterization of solutions for cooperative games has a long history, but until recently only solutions for cooperative games with transferable utility and bargaining problems
The egalitarian solutions for general cooperative games which were defined and axiomatized by Kalai and Samet, are compared to the Harsanyi solution. It is shown that axioms used by Hart to characterize the Harsanyi solution can be used to characterize the (symmetric) egalitarian solution. The only changes needed are the omission of the scale covariance axiom and the inclusion, in the domain of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001