A value for games on colored communication structures
M. Ordóñez (),
A. Jiménez-Losada (),
Julio Fernández () and
Additional contact information
M. Ordóñez: Universidad de Sevilla
A. Jiménez-Losada: Universidad de Sevilla
Julio Fernández: Universidad de Sevilla
Inés Gallego: Universidad de Sevilla
Operational Research, 2021, vol. 21, issue 4, No 2, 2247-2260
Abstract Colored graphs have been used in many areas of technological research such as computer science, multiprocessor systems, network topology, etc. Normally, the term colored graph is used in a graph where its nodes have been colored. However, we work with edge colored graphs, where the ones that have been colored are the edges. The main aim of this paper is to determine a way based on cooperative game theory to measure the importance of the nodes in a network using edge colored graphs.
Keywords: Edge colored graphs; Game theory; Myerson value (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s12351-019-00535-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:operea:v:21:y:2021:i:4:d:10.1007_s12351-019-00535-8
Ordering information: This journal article can be ordered from
https://www.springer ... search/journal/12351
Access Statistics for this article
Operational Research is currently edited by Nikolaos F. Matsatsinis, John Psarras and Constantin Zopounidis
More articles in Operational Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().