Games on fuzzy communication structures with Choquet players |
| |
Authors: | Andrés Jiménez-Losada Julio R Fernández Manuel Ordóñez Michel Grabisch |
| |
Institution: | 1. Escuela Superior de Ingenieros, Matemtica Aplicada II, Universidad de Sevilla, Camino de los Descubrimientos, 41092 Sevilla, Spain;2. Centre d’Économie de la Sorbonne, Universit Paris I Panthon-Sorbonne, 106-112 Bd de l’Hôpital, 75013 Paris, France |
| |
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. |
| |
Keywords: | Game theory Fuzzy sets Graph theory Shapley value |
本文献已被 ScienceDirect 等数据库收录! |
|