Weighted component fairness for forest games
نویسندگان
چکیده
We present the axiom of weighted component fairness for the class of forest games, a generalization of component fairness introduced by Herings, Talman and van der Laan (2008) in order to characterize the average tree solution. Given a system of weights, component efficiency and weighted component fairness yield a unique allocation rule. We provide an analysis of the set of allocation rules generated by component efficiency and weighted component fairness. This allows us to provide a new characterization of the random tree solutions.
منابع مشابه
Cooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملThe average tree solution for multi-choice forest games
In this article we study cooperative multi-choice games with limited cooperation possibilities, represented by an undirected forest on the player set. Players in the game can cooperate if they are connected in the forest. We introduce a new (single-valued) solution concept which is a generalization of the average tree solution defined and characterized by Herings et al. [2008] for TU-games play...
متن کاملCuadernos De Trabajo
In this paper we deal with TU games in which cooperation is restricted by means of a weighted network. We admit several interpretations for the weights of a link: capacity of the communication channel, flow across it, intimacy or intensity in the relation, distance between both incident nodes/players, cost of building or maintaining the communication link or even probability of the relation (as...
متن کاملCompensations in the Shapley value and the compensation solutions for graph games
We consider an alternative expression of the Shapley value that reveals a system of compensations: each player receives an equal share of the worth of each coalition he belongs to, and has to compensate an equal share of the worth of any coalition he does not belong to. We give an interpretation in terms of formation of the grand coalition according to an ordering of the players and define the ...
متن کاملParameterized fairness axioms on cycle-free graph games
We study cooperative transferable utility games with a communication structure represented by an undirected graph, i.e., a group of players can cooperate only if they are connected on the graph. This type of games is called graph games and the best-known solution for them is the Myerson value, which is characterized by the component efficiency axiom and the fairness axiom. Recently the average ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Social Sciences
دوره 64 شماره
صفحات -
تاریخ انتشار 2012