English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Maximizing the Minimum Load for Selfish Agents

Epstein, L., & van Stee, R. (2008). Maximizing the Minimum Load for Selfish Agents. In E. S. Laber, C. Bornstein, L. T. Noguiera, & L. Faria (Eds.), LATIN 2008: Theoretical Informatics (pp. 264-275). Berlin: Springer. doi:10.1007/978-3-540-78773-0_23.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1C2B-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-F330-E
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Epstein, Leah1, Author
van Stee, Rob2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the classical load balancing problem, this problem has not been considered for selfish agents until now. For a constant number of machines, $m$, we show a monotone polynomial time approximation scheme (PTAS) with running time that is linear in the number of jobs. It uses a new technique for reducing the number of jobs while remaining close to the optimal solution. We also present an FPTAS for the classical machine covering problem, i.e., where no selfish agents are involved (the previous best result for this case was a PTAS) and use this to give a monotone FPTAS. Additionally, we give a monotone approximation algorithm with approximation ratio $\min(m,(2+\varepsilon)s_1/s_m)$ where $\varepsilon>0$ can be chosen arbitrarily small and $s_i$ is the (real) speed of machine $i$. Finally we give improved results for two machines.

Details

show
hide
Language(s): eng - English
 Dates: 2009-03-0320082008
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 428067
DOI: 10.1007/978-3-540-78773-0_23
URI: http://www.springerlink.com/content/m4041512q2616208/fulltext.pdf
Other: Local-ID: C125756E0038A185-7437786F00E9A7EEC125753C0040D2EC-vanStee2008a
 Degree: -

Event

show
hide
Title: 8th Latin American Symposium on
Place of Event: Búzios, Brazil
Start-/End Date: 2008-04-07 - 2008-04-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: LATIN 2008: Theoretical Informatics
  Abbreviation : LATIN 2008
  Subtitle : 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008. Proceedings
Source Genre: Proceedings
 Creator(s):
Laber, Eduardo Sany1, Editor
Bornstein, Claudson1, Editor
Noguiera, Loana Tito1, Editor
Faria, Luerbio1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 264 - 275 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 4957 Sequence Number: - Start / End Page: - Identifier: ISSN: 0302-9743