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

57.066 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Reports de recerca
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Ciències de la Computació
  • Reports de recerca
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Maximum congestion games on networks: How can we compute their equilibria?

Thumbnail
View/Open
R07-30.pdf (281,1Kb)
Share:
 
  View Usage Statistics
Cita com:
hdl:2117/86307

Show full item record
Álvarez Faura, M. del CarmeMés informacióMés informacióMés informació
Francès, Guillem
Document typeResearch report
Defense date2007-09
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
We study Network Maximum Congestion Games, a class of network games where players choose a path between two given nodes in order to minimize the congestion of the bottleneck (the most congested link) of their path. For single-commodity games, we provide an algorithm which computes a Pure Nash Equilibrium in polynomial time. If all players have the same weight, the obtained equilibrium has optimum social cost. If players are allowed to have different weights, the obtained equilibrium has social cost at most 4/3 times worst than the optimum. For multi-commodity games with a fixed number of commodities and a particular graph topology, we also provide an algorithm which computes a Pure Nash Equilibria in polynomial time. We also study some issues related to the quality of the equilibria in this kind of games.
CitationÁlvarez, C., Francès, G. "Maximum congestion games on networks: How can we compute their equilibria?". 2007. 
Is part ofLSI-07-30-R
URIhttp://hdl.handle.net/2117/86307
Collections
  • Departament de Ciències de la Computació - Reports de recerca [1.104]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
R07-30.pdf281,1KbPDFView/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