{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:51:19Z","timestamp":1767340279785,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642248726"},{"type":"electronic","value":"9783642248733"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24873-3_6","type":"book-chapter","created":{"date-parts":[[2011,10,11]],"date-time":"2011-10-11T07:08:48Z","timestamp":1318316928000},"page":"67-81","source":"Crossref","is-referenced-by-count":23,"title":["Strategy-Proof Mechanisms for Facility Location Games with Many Facilities"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen","family":"Kim Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fanny","family":"Pascual","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Spanjaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.1100.0457","volume":"35","author":"N. Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Math. Oper. Res.\u00a035, 513\u2013526 (2010)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/174130.174131","volume":"40","author":"D. Coppersmith","year":"1993","unstructured":"Coppersmith, D., Doyle, P., Raghavan, P., Snir, M.: Random Walks on Weighted Graphs and Applications to On-line Algorithms. J. of ACM\u00a040(3), 421\u2013453 (1993)","journal-title":"J. of ACM"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-17572-5_19","volume-title":"Internet and Network Economics","author":"D. Fotakis","year":"2010","unstructured":"Fotakis, D., Tzamos, C.: Winner-imposing strategyproof mechanisms for multiple facility location games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 234\u2013245. Springer, Heidelberg (2010)"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cosrev.2009.04.002","volume":"3","author":"E. Koutsoupias","year":"2009","unstructured":"Koutsoupias, E.: The k-server problem. Comp. Science Rev.\u00a03(2), 105\u2013118 (2009)","journal-title":"Comp. Science Rev."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: ACM Conf. on Electronic Com, pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H. Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Public Choice\u00a035, 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-17572-5_47","volume-title":"Internet and Network Economics","author":"T. Nguyen Kim","year":"2010","unstructured":"Nguyen Kim, T.: On (Group) strategy-proof mechanisms without payment for facility location games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 531\u2013538. Springer, Heidelberg (2010)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-79549-0_17","volume-title":"NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet","author":"G.G. Pollatos","year":"2008","unstructured":"Pollatos, G.G., Telelis, O.A., Zissimopoulos, V.: On the social cost of distributed selfish content replication. In: Das, A., Pung, H.K., Lee, F.B.S., Wong, L.W.C. (eds.) NETWORKING 2008. LNCS, vol.\u00a04982, pp. 195\u2013206. Springer, Heidelberg (2008)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: ACM Conference on Electronic Commerce, pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Schummer, J., Vohra, R.V.: Strategy-proof location on a network. Journal of Economic Theory\u00a0104 (2001)","DOI":"10.1006\/jeth.2001.2807"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24873-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T02:07:06Z","timestamp":1601604426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24873-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642248726","9783642248733"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24873-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}