{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:38:27Z","timestamp":1767339507854},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175718"},{"type":"electronic","value":"9783642175725"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17572-5_19","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T03:54:45Z","timestamp":1291607685000},"page":"234-245","source":"Crossref","is-referenced-by-count":11,"title":["Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Tzamos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Mathematics of Operations Research (to appear, 2010)","DOI":"10.1287\/moor.1100.0457"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ic.2004.06.002","volume":"194","author":"A. Anagnostopoulos","year":"2004","unstructured":"Anagnostopoulos, A., Bent, R., Upfal, E., van Hentenryck, P.: A simple and deterministic competitive algorithm for online facility location. Information and Computation\u00a0194, 175\u2013202 (2004)","journal-title":"Information and Computation"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s003550100151","volume":"18","author":"S. Barber\u00e0","year":"2001","unstructured":"Barber\u00e0, S.: An introduction to strategyproof social choice functions. Social Choice and Welfare\u00a018, 619\u2013653 (2001)","journal-title":"Social Choice and Welfare"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.geb.2005.08.002","volume":"56","author":"S. Barber\u00e0","year":"2006","unstructured":"Barber\u00e0, S., Bevi\u00e1, C.: Locating public libraries by majority: Stability, consistency and group formation. Games and Economic Behaviour\u00a056, 185\u2013200 (2006)","journal-title":"Games and Economic Behaviour"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1006\/jeth.1993.1069","volume":"61","author":"S. Barber\u00e0","year":"1994","unstructured":"Barber\u00e0, S., Jackson, M.: A characterization of strategy-proof social choice functions for economies with pure public goods. Journal of Economic Theory\u00a061, 262\u2013289 (1994)","journal-title":"Journal of Economic Theory"},{"key":"19_CR6","unstructured":"Guha, S.: Approximation Algorithms for Facility Location Problems. PhD thesis, Stanford University (2000)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially private combinatorial optimization. In: Proc. of the 21st ACM-SIAM Symposium on Discrete Algorithms, SODA 2010 (2010)","DOI":"10.1137\/1.9781611973075.90"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1145\/375827.375845","volume":"48","author":"K. Jain","year":"2001","unstructured":"Jain, K., Vazirani, V.: Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM\u00a048(2), 274\u2013296 (2001)","journal-title":"Journal of the ACM"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.jet.2007.03.006","volume":"138","author":"B.-G. Ju","year":"2008","unstructured":"Ju, B.-G.: Efficiency and consistency for locating multiple public facilities. Journal of Economic Theory\u00a0138, 165\u2013183 (2008)","journal-title":"Journal of Economic Theory"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proc. of the 11th ACM Conference on Electronic Commerce (EC 2010), pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-10841-9_14","volume-title":"Internet and Network Economics","author":"P. Lu","year":"2009","unstructured":"Lu, P., Wang, Y., Zhou, Y.: Tighter bounds for facility games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 137\u2013148. Springer, Heidelberg (2009)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proc. of the 48th IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: Online facility location. In: Proc. of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 426\u2013431 (2001)","DOI":"10.1109\/SFCS.2001.959917"},{"volume-title":"Discrete Location Theory","year":"1990","key":"19_CR14","unstructured":"Mirchandani, P.B., Francis, R.L. (eds.): Discrete Location Theory. Wiley, Chichester (1990)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s003550000074","volume":"18","author":"E. Miyagawa","year":"2001","unstructured":"Miyagawa, E.: Locating libraries on a street. Social Choice and Welfare\u00a018, 527\u2013541 (2001)","journal-title":"Social Choice and Welfare"},{"key":"19_CR16","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":"19_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. CoRR abs\/1004.2888 (2010)","DOI":"10.2139\/ssrn.2017224"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proc. of the 10th ACM Conference on Electronic Commerce (EC 2009), pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jeth.2001.2807","volume":"104","author":"J. Schummer","year":"2002","unstructured":"Schummer, J., Vohra, R.V.: Strategyproof location on a network. Journal of Economic Theory\u00a0104, 405\u2013428 (2002)","journal-title":"Journal of Economic Theory"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44436-X_4","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"D. Shmoys","year":"2000","unstructured":"Shmoys, D.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol.\u00a01913, pp. 27\u201333. Springer, Heidelberg (2000)"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2938268","volume":"49","author":"Y. Sprumont","year":"1991","unstructured":"Sprumont, Y.: The division problem with single-peaked preferences: A characterization of the uniform allocation rule. Econometrica\u00a049, 509\u2013519 (1991)","journal-title":"Econometrica"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"68","DOI":"10.2307\/136023","volume":"28","author":"Y. Sprumont","year":"1995","unstructured":"Sprumont, Y.: Strategyproof collective choice in economic and political environments. The Canadian Journal of Economics\u00a028(1), 68\u2013108 (1995)","journal-title":"The Canadian Journal of Economics"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17572-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T16:54:28Z","timestamp":1559840068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}