{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:49Z","timestamp":1759637629586,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046118"},{"type":"electronic","value":"9783030046125"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_1","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Ordinal Approximation for Social Choice, Matching, and Facility Location Problems Given Candidate Positions"],"prefix":"10.1007","author":[{"given":"Elliot","family":"Anshelevich","sequence":"first","affiliation":[]},{"given":"Wennan","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abramowitz, B., Anshelevich, E.: Utilitarians without utilities: maximizing social welfare for graph problems using only ordinal preferences. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11453"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Bhardwaj, O., Postl, J.: Approximating optimal social choice under metric preferences. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9308"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Postl, J.: Randomized social choice functions under metric preferences. In: IJCAI (2016)","DOI":"10.1609\/aaai.v29i1.9308"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Sekar, S.: Blind, greedy, and random: algorithms for matching and clustering using only ordinal information. In: AAAI (2016)","DOI":"10.1609\/aaai.v30i1.10032"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-662-54110-4_19","volume-title":"Web and Internet Economics","author":"E Anshelevich","year":"2016","unstructured":"Anshelevich, E., Sekar, S.: Truthful mechanisms for matching and clustering in an ordinal world. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 265\u2013278. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_19"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-66700-3_21","volume-title":"Algorithmic Game Theory","author":"E Anshelevich","year":"2017","unstructured":"Anshelevich, E., Zhu, W.: Tradeoffs between information and ordinal approximation for bipartite matching. In: Bil\u00f2, V., Flammini, M. (eds.) SAGT 2017. LNCS, vol. 10504, pp. 267\u2013279. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66700-3_21"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Benade, G., Nath, S., Procaccia, A.D., Shah, N.: Preference elicitation for participatory budgeting. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.10563"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-22935-0_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A Bhalgat","year":"2011","unstructured":"Bhalgat, A., Chakrabarty, D., Khanna, S.: Social welfare in one-sided matching markets without money. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2011. LNCS, vol. 6845, pp. 87\u201398. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22935-0_8"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1111\/j.1468-0262.2004.00483.x","volume":"72","author":"A Bogomolnaia","year":"2004","unstructured":"Bogomolnaia, A., Moulin, H.: Random matching under dichotomous preferences. Econometrica 72(1), 257\u2013279 (2004)","journal-title":"Econometrica"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.artint.2015.06.003","volume":"227","author":"C Boutilier","year":"2015","unstructured":"Boutilier, C., Caragiannis, I., Haber, S., Lu, T., Procaccia, A.D., Sheffet, O.: Optimal social choice functions: a utilitarian view. Artif. Intell. 227, 190\u2013213 (2015)","journal-title":"Artif. Intell."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Byrka, ., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for k-median, and positive correlation in budgeted optimization. In: SODA (2014)","DOI":"10.1137\/1.9781611973730.50"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-662-54110-4_17","volume-title":"Web and Internet Economics","author":"I Caragiannis","year":"2016","unstructured":"Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S.K.S., Hansen, K.A., Tan, Z.: Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 236\u2013250. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_17"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1613\/jair.5282","volume":"58","author":"I Caragiannis","year":"2017","unstructured":"Caragiannis, I., Nath, S., Procaccia, A.D., Shah, N.: Subset selection via implicit utilitarian voting. J. Artif. Intell. Res. 58, 123\u2013152 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Dughmi, S., Kempe, D.: Of the people: voting is more effective with representative candidates. In: EC (2017)","DOI":"10.1145\/3033274.3085155"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Dughmi, S., Kempe, D.: On the distortion of voting with multiple representative candidates. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11469"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-46882-2_3","volume-title":"Autonomous Agents and Multiagent Systems","author":"G Christodoulou","year":"2016","unstructured":"Christodoulou, G., Filos-Ratsikas, A., Frederiksen, S.K.S., Goldberg, P.W., Zhang, J., Zhang, J.: Social welfare in one-sided matching mechanisms. In: Osman, N., Sierra, C. (eds.) AAMAS 2016. LNCS (LNAI), vol. 10002, pp. 30\u201350. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46882-2_3"},{"key":"1_CR17","volume-title":"The Spatial Theory of Voting: An Introduction","author":"JM Enelow","year":"1984","unstructured":"Enelow, J.M., Hinich, M.J.: The Spatial Theory of Voting: An Introduction. Cambridge University Press, New York (1984)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-319-71924-5_13","volume-title":"Web and Internet Economics","author":"B Fain","year":"2017","unstructured":"Fain, B., Goel, A., Munagala, K., Sakshuwong, S.: Sequential deliberation for social choice. In: Devanur, N.R., Lu, P. (eds.) WINE 2017. LNCS, vol. 10660, pp. 177\u2013190. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71924-5_13"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility Location: Concepts, Models, Algorithms and Case Studies","author":"RZ Farahani","year":"2009","unstructured":"Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-7908-2151-2"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Golomb, I.: On voting and facility location. In: EC (2016)","DOI":"10.1145\/2940716.2940725"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-44803-8_1","volume-title":"Algorithmic Game Theory","author":"A Filos-Ratsikas","year":"2014","unstructured":"Filos-Ratsikas, A., Frederiksen, S.K.S., Zhang, J.: Social welfare in one-sided matchings: random priority and beyond. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 1\u201312. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44803-8_1"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Goel, A., Krishnaswamy, A.K., Munagala, K.: Metric distortion of social choice rules: lower bounds and fairness properties. In: EC (2017)","DOI":"10.1145\/3033274.3085138"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Gross, S., Anshelevich, E., Xia, L.: Vote until two of you agree: mechanisms with small distortion and sample complexity. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.10587"},{"issue":"2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"1_CR25","unstructured":"Hoefer, M., Kodric, B.: Combinatorial secretary problems with ordinal information. In: ICALP (2017)"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-22012-8_5","volume-title":"Automata, Languages and Programming","author":"S Li","year":"2011","unstructured":"Li, S.: A 1.488 approximation algorithm for the uncapacitated facility location problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 77\u201388. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22012-8_5"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/11839354_23","volume-title":"Cooperative Information Agents X","author":"AD Procaccia","year":"2006","unstructured":"Procaccia, A.D., Rosenschein, J.S.: The distortion of cardinal preferences in voting. In: Klusch, M., Rovatsos, M., Payne, T.R. (eds.) CIA 2006. LNCS (LNAI), vol. 4149, pp. 317\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11839354_23"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Skowron, P.K., Elkind, E.: Social choice under metric preferences: scoring rules and STV. In: AAAI (2017)","DOI":"10.1609\/aaai.v31i1.10591"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04612-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:33:28Z","timestamp":1709825608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","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":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"28","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":"8","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":"24% - 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":"10","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)"}}]}}