SIGN IN
SIGN UP
On the truthfulness and the approximation for scheduling selfish tasks
Full Text:
Pdf
Buy this Article
Authors:
Eric Angel
University of Evry, France
Evripidis Bampis
University of Evry, France
Fanny Pascual
LIG-IMAG, Grenoble, France
Alex-Ariel Tchetgnia
University of Evry, France
2007 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Downloads (cumulative): 113
· Citation Count: 0
Published in:
· Proceeding
SPAA '07
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Pages 196 - 197
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-667-7
doi>
10.1145/1248377.1248410
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SPAA '13
Share:
|
Tags:
algorithms
approximation algorithms
game theory
miscellaneous
scheduling
truthfulness
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder