Skip to main content

Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNISA,volume 8146)

Abstract

We design a Copula-based generic randomized truthful mechanism for scheduling on two unrelated machines with approximation ratio within [1.5852, 1.58606], offering an improved upper bound for the two-machine case. Moreover, we provide an upper bound 1.5067711 for the two-machine two-task case, which is almost tight in view of the lower bound of 1.506 for the scale-free truthful mechanisms [6]. Of independent interest is the explicit incorporation of the concept of Copula in the design and analysis of the proposed approximation algorithm. We hope that techniques like this one will also prove useful in solving other problems in the future.

Keywords

  • Algorithmic mechanism design
  • Random mechanism
  • Copula
  • Truthful scheduling

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-41392-6_20
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   39.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-41392-6
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   54.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chen, X., Du, D., Zuluaga, L.F.: Copula-based randomized mechanisms for truthful scheduling on two unrelated machines. CoRR abs/1306.3909 (2013)

    Google Scholar 

  2. Christodoulou, G., Koutsoupias, E., Vidali, A.: A characterization of 2-player mechanisms for scheduling. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 297–307. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  3. Dobzinski, S., Sundararajan, M.: On characterizations of truthful mechanisms for combinatorial auctions and scheduling. In: Proceedings of the 9th ACM Conference on Electronic Commerce, EC 2008, pp. 38–47 (2008)

    Google Scholar 

  4. Koutsoupias, E., Vidali, A.: A lower bound of 1 + φ for truthful scheduling mechanisms. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 454–464. Springer, Heidelberg (2007)

    CrossRef  Google Scholar 

  5. Lavi, R., Mu’Alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, pp. 574–583 (2003)

    Google Scholar 

  6. Lu, P.: On 2-player randomized mechanisms for scheduling. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 30–41. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  7. Lu, P., Yu, C.: An improved randomized truthful mechanism for scheduling unrelated machines. In: Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008, pp. 527–538 (2008)

    Google Scholar 

  8. Lu, P., Yu, C.: Randomized truthful mechanisms for scheduling unrelated machines. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 402–413. Springer, Heidelberg (2008)

    CrossRef  Google Scholar 

  9. McNeil, A.J., Nešlehová, J.: Multivariate archimedean copulas, d-monotone functions and l 1-norm symmetric distributions. The Annals of Statistics 37(5), 3059–3097 (2009)

    MathSciNet  CrossRef  MATH  Google Scholar 

  10. Mu’alem, A., Schapira, M.: Setting lower bounds on truthfulness: extended abstract. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 1143–1152 (2007)

    Google Scholar 

  11. Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior 35, 166–196 (2001)

    MathSciNet  CrossRef  MATH  Google Scholar 

  12. Ugray, Z., Lasdon, L., Plummer, J.C., Glover, F., Kelly, J., Martí, R.: Scatter search and local nlp solvers: A multistart framework for global optimization. INFORMS Journal on Computing 19(3), 328–340 (2007)

    MathSciNet  CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, X., Du, D., Zuluaga, L.F. (2013). Copula-Based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines. In: Vöcking, B. (eds) Algorithmic Game Theory. SAGT 2013. Lecture Notes in Computer Science, vol 8146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41392-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41392-6_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41391-9

  • Online ISBN: 978-3-642-41392-6

  • eBook Packages: Computer ScienceComputer Science (R0)