Show simple item record

dc.contributor.authorKoutsoupias, Eliasen
dc.contributor.authorMavronicolas, Mariosen
dc.contributor.authorSpirakis, Paul G.en
dc.creatorKoutsoupias, Eliasen
dc.creatorMavronicolas, Mariosen
dc.creatorSpirakis, Paul G.en
dc.date.accessioned2019-11-13T10:40:47Z
dc.date.available2019-11-13T10:40:47Z
dc.date.issued2003
dc.identifier.issn1432-4350
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/54300
dc.description.abstractWe consider selfish routing over a network consisting of m parallel links through which n selfish users route their traffic trying to minimize their own expected latency. We study the class of mixed strategies in which the expected latency through each link is at most a constant multiple of the optimum maximum latency had global regulation been available. For the case of uniform links it is known that all Nash equilibria belong to this class of strategies. We are interested in bounding the coordination ratio (or price of anarchy) of these strategies defined as the worst-case ratio of the maximum (over all links) expected latency over the optimum maximum latency. The load balancing aspect of the problem immediately implies a lower bound ω (ln m/ln ln m) of the coordination ratio. We give a tight (up to a multiplicative constant) upper bound. To show the upper bound, we analyze a variant of the classical balls and bins problem, in which balls with arbitrary weights are placed into bins according to arbitrary probability distributions. At the heart of our approach is a new probabilistic tool that we call ball fusionen
dc.description.abstractthis tool is used to reduce the variant of the problem where balls bear weights to the classical version (with no weights). Ball fusion applies to more general settings such as links with arbitrary capacities and other latency functions.en
dc.sourceTheory of Computing Systemsen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-0346361532&doi=10.1007%2fs00224-003-1131-5&partnerID=40&md5=b069abb044760d2d90fbb0d55bd3a121
dc.subjectProblem solvingen
dc.subjectGame theoryen
dc.subjectApproximation theoryen
dc.subjectTelecommunication networksen
dc.subjectProbability distributionsen
dc.subjectParallel processing systemsen
dc.subjectTelecommunication trafficen
dc.subjectRoutersen
dc.subjectMultiobjective problemsen
dc.subjectSaddle-point equilibriumen
dc.titleApproximate Equilibria and Ball Fusionen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1007/s00224-003-1131-5
dc.description.volume36
dc.description.issue6
dc.description.startingpage683
dc.description.endingpage693
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Cited By :76</p>en
dc.source.abbreviationTheory Comput.Syst.en
dc.contributor.orcidSpirakis, Paul G. [0000-0001-5396-3749]


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record