Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
478617 | European Journal of Operational Research | 2010 | 12 Pages |
Abstract
Myerson (1977) used graph-theoretic ideas to analyze cooperation structures in games. In his model, he considered the players in a cooperative game as vertices of a graph, which undirected edges defined their communication possibilities. He modified the initial games taking into account the graph and he established a fair allocation rule based on applying the Shapley value to the modified game. Now, we consider a fuzzy graph to introduce leveled communications. In this paper players play in a particular cooperative way: they are always interested first in the biggest feasible coalition and second in the greatest level (Choquet players). We propose a modified game for this situation and a rule of the Myerson kind.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Andrés Jiménez-Losada, Julio R. Fernández, Manuel Ordóñez, Michel Grabisch,