Artículo
A Value for Graph-Restricted Games with Middlemen on Edges
Autor/es | Alarcón Carrero, Antonio Carlos
Gallardo Morilla, José Manuel Jiménez Losada, Andrés |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada II |
Fecha de publicación | 2022-05 |
Fecha de depósito | 2024-01-17 |
Publicado en |
|
Resumen | In a cooperative game with a communication structure, a graph describes the communication possibilities of the players, which are represented by the nodes. We introduce a variation of this model by assuming that each edge ... In a cooperative game with a communication structure, a graph describes the communication possibilities of the players, which are represented by the nodes. We introduce a variation of this model by assuming that each edge in the communication graph represents an agent. These agents simply act as intermediaries, but since they are essential for the cooperation and, consequently, for revenue generation, they will claim their share of the profit. We study this new model of games with a communication structure and introduce an allocation rule for these games. The motivation for analyzing this type of problem is based on the construction of a risk index for the different elements of an internal network. |
Agencias financiadoras | Andalusian Regional Government under grant FQM-237 |
Cita | Alarcón Carrero, A.C., Gallardo Morilla, J.M. y Jiménez Losada, A. (2022). A Value for Graph-Restricted Games with Middlemen on Edges. Mathematics, 10 (11), 1-15. https://doi.org/10.3390/math10111856. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
middlemen.pdf | 614.8Kb | [PDF] | Ver/ | |
Este registro aparece en las siguientes colecciones
Este documento está protegido por los derechos de propiedad intelectual e industrial. Sin perjuicio de las exenciones legales existentes, queda prohibida su reproducción, distribución, comunicación pública o transformación sin la autorización del titular de los derechos, a menos que se indique lo contrario.