Alarcón Carrero, Antonio CarlosGallardo Morilla, José ManuelJiménez Losada, Andrés2023-04-112023-04-112022Alarcón, A. C., Gallardo, J. M., & Jiménez-Losada, A. (2022). A Value for Graph-Restricted Games with Middlemen on Edges. In Mathematics (Vol. 10, Issue 11, p. 1856). MDPI AG. https://doi.org/10.3390/math101118562227-7390 (electrónico)https://hdl.handle.net/10272/21928In 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.engAtribución-NoComercial-SinDerivadas 3.0 Españahttp://creativecommons.org/licenses/by-nc-nd/3.0/es/Cooperative gameShapley valueRestricted cooperationGraph-restricted gameMyerson valuejournal article10.3390/math10111856open access12 Matemáticas