Dynamic Mechanism Design

  • Davide Bilò
  • Luciano Gualà
  • Guido Proietti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4286)

Abstract

In this paper we address the question of designing truthful mechanisms for solving optimization problems on dynamic graphs. More precisely, we are given a graph G of n nodes, and we assume that each edge of G is owned by a selfish agent. The strategy of an agent consists in revealing to the system the cost for using its edge, but this cost is not constant and can change over time. Additionally, edges can enter into and exit from G. Among the various possible assumptions which can be made to model how these edge-cost modifications take place, we focus on two settings: (i) the dynamic, in which modifications are unpredictable and time-independent, and for a given optimization problem on G, the mechanism has to maintain efficiently the output specification and the payment scheme for the agents; (ii) the time-sequenced, in which modifications happens at fixed time steps, and the mechanism has to minimize an objective function which takes into consideration both the quality and the set-up cost of a new solution. In both settings, we investigate the existence of exact and approximate truthful mechanisms. In particular, for the dynamic setting, we analyze the minimum spanning tree problem, and we show that if edge costs can only decrease, then there exists an efficient dynamic truthful mechanism for handling a sequence of k edge-cost reductions having runtime \({\cal O}(h \log n +k \log^4 n)\), where h is the overall number of payment changes.

Keywords

Algorithmic Mechanism Design On-line Problems Dynamic Algorithms Approximate Mechanisms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Minimizing diameters of dynamic trees. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 270–280. Springer, Heidelberg (1997)Google Scholar
  2. 2.
    Archer, A., Tardos, É.: Truthful mechanisms for one-parameter agents. In: Proc. 42nd IEEE Symp. on Foundations of Computer Science (FOCS 2001), pp. 482–491 (2001)Google Scholar
  3. 3.
    Biló, D., Gualá, L., Proietti, G.: On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 295–309. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Briest, P., Krysta, P., Vöcking, B.: Approximation techniques for utilitarian mechanism design. In: Proc. 37th Ann. ACM Symp. on Theory of Computing (STOC 2005), pp. 39–48 (2005)Google Scholar
  5. 5.
    Frederickson, G.N.: Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14(4), 781–798 (1985)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Friedman, E.J., Parkes, D.C.: Pricing WiFi at Starbucks: issues in online mechanism design. In: 4th ACM Conf. on Electronic Commerce (EC 2003), pp. 240–241 (2003)Google Scholar
  7. 7.
    Gualá, L., Proietti, G.: A truthful (2-2/k)-approximation mechanism for the Steiner tree problem with k terminals. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 390–400. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Gualá, L., Proietti, G.: Efficient truthful mechanisms for the single-source shortest paths tree problem. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol. 3648, pp. 941–951. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proc. 42nd IEEE Symp. on Foundations of Computer Science (FOCS 2001), pp. 252–259 (2001)Google Scholar
  10. 10.
    Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. of the ACM 48(4), 723–760 (2001)MATHCrossRefGoogle Scholar
  11. 11.
    Kalyanasundaram, B., Pruhs, K.: On-line network optimization problems. In: Fiat, A. (ed.) Online Algorithms: The State of the Art. LNCS, vol. 1442, pp. 268–280. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  12. 12.
    Kao, M.-Y., Li, X.-Y., Wang, W.: Towards truthful mechanisms for binary demand games: a general framework. In: Proc. 6th ACM Conf. on Electronic Commerce 2005, pp. 213–222 (2005)Google Scholar
  13. 13.
    Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behaviour 35, 166–196 (2001)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Parkes, D.C., Singh, S.P., Yanovsky, D.: Approximately efficient online mechanism design. In: Adv. in Neural Information Processing Syst. 17 (NIPS 2004) (2004)Google Scholar
  15. 15.
    Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362–391 (1983)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Davide Bilò
    • 1
  • Luciano Gualà
    • 1
  • Guido Proietti
    • 1
    • 2
  1. 1.Dipartimento di InformaticaUniversità di L’AquilaItaly
  2. 2.Istituto di Analisi dei Sistemied Informatica, CNRRomaItaly

Personalised recommendations