Conference item icon

Conference item

The anarchy of scheduling without money

Abstract:

We consider the scheduling problem on n strategic unrelated machines when no payments are allowed, under the objective of minimizing the makespan. We adopt the model introduced in [Koutsoupias 2014] where a machine is bound by her declarations in the sense that if she is assigned a particular job then she will have to execute it for an amount of time at least equal to the one she reported, even if her private, true processing capabilities are actually faster. We provide a (non-truthful) rando...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-662-53354-3_24

Authors


More by this author
Department:
Oxford, MPLS, Computer Science
Role:
Author
More by this author
Department:
Oxford, MPLS, Computer Science
Role:
Author
Publisher:
Springer Publisher's website
Volume:
9928
Pages:
302-314
Publication date:
2016-09-05
Acceptance date:
2016-07-01
DOI:
ISSN:
0302-9743
Pubs id:
pubs:689043
URN:
uri:f1361bb2-1bd7-4285-b47f-6049f0d2b448
UUID:
uuid:f1361bb2-1bd7-4285-b47f-6049f0d2b448
Local pid:
pubs:689043

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP