Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

58.837 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Matemàtiques
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Matemàtiques
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Nodes of directed graphs ranked by solutions defined on cooperative games

Thumbnail
View/Open
Article principal (193,6Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/10491

Show full item record
Amer Ramon, RafaelMés informacióMés informacióMés informació
Giménez Pradales, José MiguelMés informacióMés informacióMés informació
Magaña Nieto, AntonioMés informacióMés informacióMés informació
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. 
URIhttp://hdl.handle.net/2117/10491
DLC-2913-2010
ISBN978-84-693-6152-8
Collections
  • Departament de Matemàtiques - Ponències/Comunicacions de congressos [1.015]
  • GRTJ - Grup de Recerca en Teoria de Jocs - Ponències/Comunicacions de congressos [20]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
32CNEIO_239-AmerRamonR.pdfArticle principal193,6KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina