{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:35:58Z","timestamp":1767339358921,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304720"},{"type":"electronic","value":"9783030304737"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_5","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"63-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Mechanism Design for Constrained Heterogeneous Facility Location"],"prefix":"10.1007","author":[{"given":"Maria","family":"Kyropoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaomeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"5_CR1","unstructured":"Anastasiadis, E., Deligkas, A.: Heterogeneous facility location games. In: AAMAS, pp. 623\u2013631 (2018)"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1006\/jeth.1993.1069","volume":"61","author":"S Barber\u00e1","year":"1993","unstructured":"Barber\u00e1, S., Gul, F., Stacchetti, E.: Generalized median voter schemes and committees. J. Econ. Theor. 61(2), 262\u2013289 (1993)","journal-title":"J. Econ. Theor."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: ACM EC, pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"5_CR4","volume-title":"Handbook of Computational Social Choice, Chapter 17","author":"U Endriss","year":"2016","unstructured":"Endriss, U.: Judgment aggregation. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, Chapter 17. Cambridge University Press, Cambridge (2016)"},{"key":"5_CR5","unstructured":"Ferraioli, D., Serafino, P., Ventre, C.: What to verify for optimal truthful mechanisms without money. In: AAMAS, pp. 68\u201376 (2016)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Fong, C.K.K., Li, M., Lu, P., Todo, T., Yokoo, M.: Facility location games with fractional preferences. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11458"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Tzamos, C.: On the power of deterministic mechanisms for facility location games. In: ICALP, pp. 449\u2013460 (2013)","DOI":"10.1007\/978-3-642-39206-1_38"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.2307\/1914083","volume":"41","author":"A Gibbard","year":"1973","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica 41(4), 587\u2013601 (1973)","journal-title":"Econometrica"},{"key":"5_CR9","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 EC, pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"5_CR10","first-page":"137","volume-title":"Lecture Notes in Computer Science","author":"Pinyan Lu","year":"2009","unstructured":"Lu, P., Wang, Y., Zhou, Y.: Tighter bounds for facility games. In: WINE, pp. 137\u2013148 (2009)"},{"key":"5_CR11","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 35, 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theor.","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theor. Cambridge University Press, Cambridge (2007)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Penna, P., Ventre, C.: Sharing the cost of multicast transmissions in wireless networks. In: SIROCCO, pp. 255\u2013266 (2004)","DOI":"10.1007\/978-3-540-27796-5_23"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. Comput. 1(4), 18 (2013)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0022-0531(75)90050-2","volume":"10","author":"MA Satterthwaite","year":"1975","unstructured":"Satterthwaite, M.A.: Strategy-proofness and arrow\u2019s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J. Econ. Theor. 10(2), 187\u2013217 (1975)","journal-title":"J. Econ. Theor."},{"issue":"2","key":"5_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jeth.1999.2618","volume":"91","author":"J Schummer","year":"2000","unstructured":"Schummer, J.: Manipulation through bribes. J. Econ. Theor. 91(2), 180\u2013198 (2000)","journal-title":"J. Econ. Theor."},{"key":"5_CR17","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.: Strategy-proof location on a network. J. Econ. Theor. 104, 405\u2013428 (2002)","journal-title":"J. Econ. Theor."},{"key":"5_CR18","unstructured":"Serafino, P., Ventre, C.: Heterogeneous facility location without money on the line. In: ECAI - Including PAIS, pp. 807\u2013812 (2014)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Serafino, P., Ventre, C.: Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In: AAAI, pp. 1029\u20131035 (2015)","DOI":"10.1609\/aaai.v29i1.9307"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2016.04.033","volume":"636","author":"P Serafino","year":"2016","unstructured":"Serafino, P., Ventre, C.: Heterogeneous facility location without money. Theor. Comput. Sci. 636, 27\u201346 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR21","unstructured":"Zou, S., Li, M.: Facility location games with dual preference. In: AAMAS, pp. 615\u2013623 (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30473-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:33:12Z","timestamp":1709811192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}