Nodes of directed graphs ranked by solutions defined on cooperative games

View/Open
Document typeConference lecture
Defense date2010
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
Hierarchical structures, transportation systems, communication networks and
even sports competitions can be modeled by means of directed graphs. Since
digraphs without a predefined game are considered, the main part of the work is
devoted to establish conditions on cooperative games so that they can be used
to measure accessibility to the nodes. Games that satisfy desirable properties
are called test games. Each ranking on the nodes is then obtained according
to a pair formed by a test game and a solution defined on cooperative games
whose utilities are given for every ordered coalition. Solutions here proposed
are extensions of the wide family of semivalues to games in generalized characteristic
function form.
CitationAmer, R.; Giménez, J.; Magaña, A. Nodes of directed graphs ranked by solutions defined on cooperative games. A: Congreso Nacional de Estadística e Investigación Operativa. "XXXII Congreso Nacional de Estadística e Investigación Operativa". A Coruña: 2010, p. 1-20.
DLC-2913-2010
ISBN978-84-693-6152-8
Files | Description | Size | Format | View |
---|---|---|---|---|
32CNEIO_239-AmerRamonR.pdf | Article principal | 193,6Kb | View/Open |