Back to Search

Journal article

A Lower Bound of 1+φ for Truthful Scheduling Mechanisms

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Koutsoupias, E., & Vidali, A. (2013). A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. Algorithmica, 66(1), 211–223.

MLA Style

Koutsoupias, E., and A. Vidali. “A Lower Bound of 1+φ for Truthful Scheduling Mechanisms.” Algorithmica, vol. 66, no. 1, 2013, pp. 211–23.

Chicago Style

Koutsoupias, E, and A Vidali. 2013. “A Lower Bound of 1+φ for Truthful Scheduling Mechanisms.” Algorithmica 66 (1): 211–23.
Tweet
Print

Authors

+ Koutsoupias, E More by this author

Role:

Author

+ Vidali, A More by this author

Role:

Author

Bibliographic Details

Journal:: Algorithmica
Volume:: 66
Issue:: 1
Pages:: 211-223
Publication date:: 2013-01-01

Item Description

UUID:: uuid:6dae73bd-154e-4e3c-9937-28a35a9fe9c7
Local pid:: cs:7939
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2013

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About 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