Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13226
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKarakostas, G.en
dc.contributor.authorKim, T.en
dc.contributor.authorViglas, A.en
dc.contributor.authorXia, H.en
dc.date.accessioned2015-11-24T17:26:34Z-
dc.date.available2015-11-24T17:26:34Z-
dc.identifier.issn0191-2615-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13226-
dc.rightsDefault Licence-
dc.subjectuser equilibriumen
dc.subjectprice of anarchyen
dc.subjectoblivious usersen
dc.subjectfixed demanden
dc.subjectvariational inequality formulationen
dc.subjecttransportation networken
dc.subjectassignment problemen
dc.subjectequilibriumen
dc.subjectmodelsen
dc.subjectanarchyen
dc.subjectdesignen
dc.subjectpriceen
dc.titleOn the degradation of performance for traffic networks with oblivious usersen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primaryDOI 10.1016/j.trb.2010.07.004-
heal.identifier.secondary<Go to ISI>://000287110500004-
heal.identifier.secondaryhttp://ac.els-cdn.com/S0191261510000998/1-s2.0-S0191261510000998-main.pdf?_tid=59988550-873f-11e3-8d47-00000aab0f6c&acdnat=1390819370_e34d4e715a9f0d27e48a0b3b4f3fe0ae-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.publicationDate2011-
heal.abstractWe consider the problem of characterizing user equilibria and optimal solutions for routing in a given network. We extend the known models by considering users oblivious to congestion in the following sense: While in the typical user equilibrium setting the users follow a strategy that minimizes their individual cost by taking into account the (dynamic) congestion due to the current routing pattern, an oblivious user ignores congestion altogether; instead, he or she decides his routing on the basis of cheapest routes on a network without any flow whatsoever. These cheapest routes can be, for example, the shortest paths in the network without any flow. This model tries to capture the fact that a certain percentage of travelers base their route simply on the distances they observe on a map, without thinking (or knowing, or caring) about the delays experienced on this route due to their fellow travelers. In this work we study the effect of such users using as the measure of network performance its price of anarchy, i.e., the ratio of the total latency experienced by the users (oblivious or not) at equilibrium over the social optimum. (C) 2010 Elsevier Ltd. All rights reserved.en
heal.journalNameTransportation Research Part B-Methodologicalen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Karakostas-2011-On the degradation o.pdf233.42 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons