{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:28:33Z","timestamp":1725474513854},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_34","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:41:09Z","timestamp":1164652869000},"page":"377-388","source":"Crossref","is-referenced-by-count":2,"title":["Strongly Polynomial-Time Truthful Mechanisms in One Shot"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Penna","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"Davenport-Schinzel sequences and their geometric applications","author":"P.K. Agarwal","year":"1995","unstructured":"Agarwal, P.K., Sharir, M.: Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, New York (1995)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: Proc. of 42nd FOCS, pp. 482\u2013491 (2001)","DOI":"10.1109\/SFCS.2001.959924"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Clarke, E.H.: Multipart Pricing of Public Goods. Public Choice, 17\u201333 (1971)","DOI":"10.1007\/BF01726210"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/570810.570812","volume-title":"Proceedings of the 6th DIALM","author":"J. Feigenbaum","year":"2002","unstructured":"Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proceedings of the 6th DIALM, pp. 1\u201313. ACM Press, New York (2002)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T. Groves","year":"1973","unstructured":"Groves, T.: Incentive in Teams. Econometrica\u00a041, 617\u2013631 (1973)","journal-title":"Econometrica"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11533719_40","volume-title":"Computing and Combinatorics","author":"L. Gual\u00e0","year":"2005","unstructured":"Gual\u00e0, 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. 90\u2013400. Springer, Heidelberg (2005)"},{"key":"34_CR7","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\u00e0","year":"2005","unstructured":"Gual\u00e0, 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)"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R. Hassin","year":"1995","unstructured":"Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Info. Proc. Lett.\u00a053(2), 109\u2013111 (1995)","journal-title":"Info. Proc. Lett."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Suri, S.: Vickrey prices and shortest paths: what is an edge worth? In: Proc. of the 42nd FOCS, pp. 252\u2013259 (2001)","DOI":"10.1109\/SFCS.2001.959899"},{"key":"34_CR10","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. of ACM EC, pp. 213\u2013222 (2005)","DOI":"10.1145\/1064009.1064032"},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"34_CR12","unstructured":"Mu\u2019Alem, A., Nisan, N.: Truthful approximation mechanisms for restricted combinatorial auctions. In: Proc. of 18th AAAI, pp. 379\u2013384 (2002)"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R. Myerson","year":"1981","unstructured":"Myerson, R.: Optimal auction design. Mathematics of Operations Research\u00a06, 58\u201373 (1981)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(02)00438-3","volume":"296","author":"E. Nardelli","year":"2003","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Finding the most vital node of a shortest path. Theoretical Computer Science\u00a0296(1), 167\u2013177 (2003)","journal-title":"Theoretical Computer Science"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: Proc. of the 31st STOC, pp. 129\u2013140 (1999)","DOI":"10.1145\/301250.301287"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the Internet. In: Proc. of the 33rd STOC, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Penna, P., Proietti, G., Widmayer, P.: Strongly polynomial-time truthful mechanisms in one shot. Technical report, Universit\u00e0 di Salerno (2006), Available at: http:\/\/ec.tcfs.it\/Group\/Selfish_Agents.html","DOI":"10.1007\/11944874_34"},{"key":"34_CR18","unstructured":"Pettie, S., Ramachandran, V.: Computing shortest paths with comparisons and additions. In: Proc. of the 13th SODA, pp. 267\u2013276 (2002)"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Proietti, G., Widmayer, P.: A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. In: Proc. of SPAA, pp. 195\u2013202 (2005)","DOI":"10.1145\/1073970.1073999"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"B.C. Tansel","year":"1983","unstructured":"Tansel, B.C., Francis, R.L., Lowe, T.J.: Location on networks: a survey. Part I: The p-center and p-median problems. Management Sciences\u00a029, 482\u2013497 (1983)","journal-title":"Management Sciences"},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"8","DOI":"10.2307\/2977633","volume":"16","author":"W. Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions and competitive sealed tenders. Journal of Finance\u00a016, 8\u201337 (1961)","journal-title":"Journal of Finance"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:00:24Z","timestamp":1605643224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11944874_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}