Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games release_t3yozmq3oja2feaeoevrr2myje

by Akaki Mamageishvili, Paolo Penna

Released as a article .

2015  

Abstract

In this paper we study the inefficiency ratio of stable equilibria in load balancing games introduced by Asadpour and Saberi [3]. We prove tighter lower and upper bounds of 7/6 and 4/3, respectively. This improves over the best known bounds in problem (19/18 and 3/2, respectively). Equivalently, the results apply to the question of how well the optimum for the L_2 -norm can approximate the L_∞-norm (makespan) in identical machines scheduling.
In text/plain format

Archived Files and Locations

application/pdf  125.8 kB
file_iwgbdmkgezhedgce7eh7gjzvee
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2015-12-10
Version   v1
Language   en ?
arXiv  1512.03484v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 311da876-97c5-4fea-8afa-3042b0655994
API URL: JSON