Mechanisms with Monitoring for Truthful RAM Allocation

  • Annamária Kovács
  • Ulrich Meyer
  • Carmine Ventre
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9470)


Novel algorithmic ideas for big data have not been accompanied by advances in the way central memory is allocated to concurrently running programs. Commonly, RAM is poorly managed since the programs’ trade offs between speed of execution and RAM consumption are ignored. This trade off is, however, well known to the programmers. We adopt mechanism design tools to truthfully elicit this (multidimensional) information with the aim of designing more clever RAM allocation algorithms. We introduce a novel paradigm wherein programs are bound to overbidding declarations of their running times. We show the limitations of this paradigm in the absence of transfers and prove how to leverage waiting times, as a currency, to obtain optimal money burning mechanisms for the makespan.


  1. 1.
    Auletta, V., De Prisco, R., Penna, P., Persiano, G.: How to route and tax selfish unsplittable traffic. In: SPAA, pp. 196–205 (2004)Google Scholar
  2. 2.
    Ben-Porath, E., Dekel, E., Lipman, B.L.: Optimal allocation with costly verification. Am. Econ. Rev. 104(12), 3779–3813 (2014)CrossRefGoogle Scholar
  3. 3.
    Blumrosen, L., Nisan, N.: On the computational power of demand queries. SIAM J. Comput. 39(4), 1372–1391 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Christodoulou, G., Gourvès, L., Pascual, F.: Scheduling selfish tasks: about the performance of truthful algorithms. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 187–197. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  5. 5.
    Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 345–357. Springer, Heidelberg (2004) CrossRefGoogle Scholar
  6. 6.
    Dementiev, R., Kettner, L., Sanders, P.: STXXL: standard template library for XXL data sets. Softw. Pract. Exper. 38(6), 589–637 (2008)CrossRefGoogle Scholar
  7. 7.
    Fiat, A., Karp, R., Luby, M., McGeoch, L., Sleator, D., Young, N.: Competitive paging algorithms. J. Algorithms 12(4), 685–699 (1991)CrossRefzbMATHGoogle Scholar
  8. 8.
    Fotakis, D., Krysta, P., Ventre, C.: Combinatorial auctions without money. In: AAMAS, pp. 1029–1036 (2014)Google Scholar
  9. 9.
    Fotakis, D., Krysta, P., Ventre, C.: The power of verification for greedy mechanism design. In: AAMAS, pp. 307–315 (2015)Google Scholar
  10. 10.
    Hartline, J.D., Roughgarden,T.: Optimal mechanism design and money burning. In: STOC, pp. 75–84 (2008)Google Scholar
  11. 11.
    Krysta, P., Ventre, C.: Combinatorial auctions with verification are tractable. Theoret. Comput. Sci. 571, 21–35 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Meyer, U., Sanders, P., Sibeyn, J.F. (eds.): Algorithms for Memory Hierarchies. LNCS, vol. 2625. Springer, Heidelberg (2003) zbMATHGoogle Scholar
  13. 13.
    Nisan, N., Ronen, A.: Algorithmic mechanism design. Games Econ. Behav. 35, 166–196 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Penna, P., Ventre, C.: Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. 86, 491–509 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Rochet, J.-C.: A condition for rationalizability in a quasi-linear context. J. Math. Econ. 16, 191–200 (1987)CrossRefzbMATHGoogle Scholar
  16. 16.
    Ventre, C.: Truthful optimization using mechanisms with verification. Theoret. Comput. Sci. 518, 64–79 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Vitter, J.S.: Algorithms and data structures for external memory. Found. Trends Theoret. Comput. Sci. 2(4), 305–474 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Vohra, R.V.: Mechanism Design: A Linear Programming Approach. Cambridge University Press, New York (2011)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Open Access This chapter is distributed under the terms of the Creative Commons Attribution Noncommercial License, which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Authors and Affiliations

  • Annamária Kovács
    • 1
  • Ulrich Meyer
    • 1
  • Carmine Ventre
    • 2
  1. 1.Goethe UniversityFrankfurt am MainGermany
  2. 2.Teesside UniversityMiddlesbroughUK

Personalised recommendations