{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:28:46Z","timestamp":1725474526281},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_2","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"3-15","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Mechanism Design"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/3-540-63165-8_184","volume-title":"Automata, Languages and Programming","author":"S. Alstrup","year":"1997","unstructured":"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.\u00a01256, pp. 270\u2013280. Springer, Heidelberg (1997)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: Proc. 42nd IEEE Symp. on Foundations of Computer Science (FOCS 2001), pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11780823_23","volume-title":"Structural Information and Communication Complexity","author":"D. Bil\u00f3","year":"2006","unstructured":"Bil\u00f3, D., Gual\u00e1, L., Proietti, G.: On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 295\u2013309. Springer, Heidelberg (2006)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P., V\u00f6cking, B.: Approximation techniques for utilitarian mechanism design. In: Proc. 37th Ann. ACM Symp. on Theory of Computing (STOC 2005), pp. 39\u201348 (2005)","DOI":"10.1145\/1060590.1060597"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"G.N. Frederickson","year":"1985","unstructured":"Frederickson, G.N.: Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput.\u00a014(4), 781\u2013798 (1985)","journal-title":"SIAM J. Comput."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013241 (2003)","DOI":"10.1145\/779928.779978"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/11533719_40","volume-title":"Computing and Combinatorics","author":"L. Gual\u00e1","year":"2005","unstructured":"Gual\u00e1, 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.\u00a03595, pp. 390\u2013400. Springer, Heidelberg (2005)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1007\/11549468_103","volume-title":"Euro-Par 2005 Parallel Processing","author":"L. Gual\u00e1","year":"2005","unstructured":"Gual\u00e1, 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.\u00a03648, pp. 941\u2013951. Springer, Heidelberg (2005)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013259 (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"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\u00a048(4), 723\u2013760 (2001)","journal-title":"J. of the ACM"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0029573","volume-title":"Online Algorithms: The State of the Art","author":"B. Kalyanasundaram","year":"1998","unstructured":"Kalyanasundaram, B., Pruhs, K.: On-line network optimization problems. In: Fiat, A. (ed.) Online Algorithms: The State of the Art. LNCS, vol.\u00a01442, pp. 268\u2013280. Springer, Heidelberg (1998)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013222 (2005)","DOI":"10.1145\/1064009.1064032"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behaviour\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behaviour"},{"key":"2_CR14","unstructured":"Parkes, D.C., Singh, S.P., Yanovsky, D.: Approximately efficient online mechanism design. In: Adv. in Neural Information Processing Syst. 17 (NIPS 2004) (2004)"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. Syst. Sci.\u00a026(3), 362\u2013391 (1983)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:09:42Z","timestamp":1558285782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11944874_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}