{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T18:32:06Z","timestamp":1775845926168,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T00:00:00Z","timestamp":1361923200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10878-013-9598-8","type":"journal-article","created":{"date-parts":[[2013,2,26]],"date-time":"2013-02-26T01:37:29Z","timestamp":1361842649000},"page":"756-773","source":"Crossref","is-referenced-by-count":19,"title":["Strategyproof mechanism design for facility location games with weighted agents on a line"],"prefix":"10.1007","volume":"28","author":[{"given":"Qiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,27]]},"reference":[{"key":"9598_CR1","doi-asserted-by":"crossref","unstructured":"Ashlagi I, Fischer F, Kash I, Procaccia A (2010) Mix and match. In: Proceedings of the 11th ACM conference on electronic commerce (ACM-EC), Cambridge, pp 305\u2013314","DOI":"10.1145\/1807342.1807392"},{"key":"9598_CR2","doi-asserted-by":"crossref","unstructured":"Caragiannis I, Filos-Ratsikas A, Procaccia A (2011) An improved 2-agent kidney exchange mechanism. In: Proceeding of the 6th international workshop of internet and network economics (WINE), Singapore, pp 37\u201348","DOI":"10.1007\/978-3-642-25510-6_4"},{"key":"9598_CR3","doi-asserted-by":"crossref","unstructured":"Chen Y, Lai J, Parkes D, Procaccia A (2010) Truth, justice, and cake cutting. In: Proceedings of 24th AAAI, Atlanta, pp 756\u2013761","DOI":"10.1609\/aaai.v24i1.7621"},{"key":"9598_CR4","doi-asserted-by":"crossref","unstructured":"Cheng Y, Yu W, Zhang G (2011) Mechanisms for obnoxious facility game on a path. Comb Optim Appl 6831:262\u2013271","DOI":"10.1007\/978-3-642-22616-8_21"},{"issue":"1","key":"9598_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"E Clarke","year":"1971","unstructured":"Clarke E (1971) Multipart pricing of public goods. Public choice 11(1):17\u201333","journal-title":"Public choice"},{"key":"9598_CR6","doi-asserted-by":"crossref","unstructured":"Escoffier B, Gourv\u00e8s L, Kim Thang N, Pascual F, Spanjaard O (2011) Strategy-proof mechanisms for facility location games with many facilities. In: Brafman RI et al. (ed) Algorithmic decision theory, vol 6992. Springer, Berlin, pp 67\u201381","DOI":"10.1007\/978-3-642-24873-3_6"},{"key":"9598_CR7","doi-asserted-by":"crossref","unstructured":"Fotakis D, Tzamos C (2010) Winner-imposing strategyproof mechanisms for multiple facility location games. In: Proceeding of the 5th international workshop of internet and network economics (WINE), pp 234\u2013245.","DOI":"10.1007\/978-3-642-17572-5_19"},{"key":"9598_CR8","doi-asserted-by":"crossref","unstructured":"Groves T (1973) Incentives in teams. Econometrica 41:617\u2013631","DOI":"10.2307\/1914085"},{"key":"9598_CR9","doi-asserted-by":"crossref","unstructured":"Lu P, Wang Y, Zhou Y (2009) Tighter bounds for facility games. In: Proceeding of the 5th international workshop of internet and network economics (WINE), Rome, pp 137\u2013148.","DOI":"10.1007\/978-3-642-10841-9_14"},{"key":"9598_CR10","doi-asserted-by":"crossref","unstructured":"Lu P, Sun X, Wang Y, Zhu Z (2010) Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM conference on electronic commerce (ACM-EC), Cambridge, pp 315\u2013324.","DOI":"10.1145\/1807342.1807393"},{"key":"9598_CR11","doi-asserted-by":"crossref","unstructured":"Nisan N, Ronen A (1999) Algorithmic mechanism design. In: Proceedings of the thirty-first annual ACM symposium on theory of computing (STOC), Atlanta, pp 129\u2013140","DOI":"10.1145\/301250.301287"},{"key":"9598_CR12","doi-asserted-by":"crossref","unstructured":"Procaccia A, Tennenholtz M (2009) Approximate mechanism design without money. In: Proceedings of the 10th ACM conference on electronic commerce (ACM-EC), Stanford, pp 177\u2013186","DOI":"10.1145\/1566374.1566401"},{"issue":"2","key":"9598_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"A Roth","year":"2005","unstructured":"Roth A, S\u00f6nmez T (2005) Pairwise kidney exchange. J Econ Theory 125(2):151\u2013188","journal-title":"J Econ Theory"},{"key":"9598_CR14","unstructured":"Todo T, Iwasaki A, Yokoo M (2011) False-name-proof mechanism design without money. In: The 10th international conference on autonomous agents and multiagent systems (AAMAS), vol 2. Taipei, pp 651\u2013658"},{"issue":"1","key":"9598_CR15","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J Financ 16(1):8\u201337","journal-title":"J Financ"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9598-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9598-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9598-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T19:23:58Z","timestamp":1688066638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9598-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,27]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["9598"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9598-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,27]]}}}