{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:33Z","timestamp":1760202753906,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_7","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"80-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Robustness Among Multiwinner Voting Rules"],"prefix":"10.1007","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Faliszewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Kaczmarczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Skowron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Elkind, E., Faliszewski, P., Lackner, M., Skowron, P.: The Condorcet principle for multiwinner elections: from shortlisting to proportionality. arXiv preprint arXiv:1701.08023 (2017)","DOI":"10.24963\/ijcai.2017\/13"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00355-007-0268-6","volume":"31","author":"S Barber\u00e0","year":"2008","unstructured":"Barber\u00e0, S., Coelho, D.: How to choose a non-controversial list with $$k$$ names. Soc. Choice Welf. 31(1), 79\u201396 (2008)","journal-title":"Soc. Choice Welf."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1613\/jair.3896","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. J. Artif. Intell. Res. 47, 475\u2013519 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR4","unstructured":"Blom, M., Stuckey, P., Teague, V.: Towards computing victory margins in STV elections. arXiv preprint arXiv:1703.03511 (2017)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Niedermeier, R., Skowron, P., Talmon, N.: Robustness among multiwinner voting rules. arXiv preprint arXiv:1707.01417 (2017)","DOI":"10.1007\/978-3-319-66700-3_7"},{"key":"7_CR6","volume-title":"Handbook of Computational Social Choice","author":"I Caragiannis","year":"2016","unstructured":"Caragiannis, I., Hemaspaandra, E., Hemaspaandra, L.: Dodgson\u2019s rule and Young\u2019s rule. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)"},{"key":"7_CR7","unstructured":"Cary, D.: Estimating the margin of victory for instant-runoff voting. Presented at EVT\/WOTE-2011, August 2011"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.2307\/1957270","volume":"77","author":"B Chamberlin","year":"1983","unstructured":"Chamberlin, B., Courant, P.: Representative deliberations and representative decisions: proportional representation and the Borda rule. Am. Polit. Sci. Rev. 77(3), 718\u2013733 (1983)","journal-title":"Am. Polit. Sci. Rev."},{"key":"7_CR9","unstructured":"Coelho, D.: Understanding, evaluating and selecting voting rules through games and axioms. Ph.D. thesis, Universitat Aut\u00f2noma de Barcelona (2004)"},{"key":"7_CR10","unstructured":"Conitzer, V., Rognlie, M., Xia, L.: Preference functions that score rankings and maximum likelihood estimation. In: Proceedings of IJCAI-2009, pp. 109\u2013115, July 2009"},{"key":"7_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Heidelberg (2015)"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s00355-017-1026-z","volume":"48","author":"E Elkind","year":"2017","unstructured":"Elkind, E., Faliszewski, P., Skowron, P., Slinko, A.: Properties of multiwinner voting rules. Social Choice Welf. 48(3), 599\u2013632 (2017)","journal-title":"Social Choice Welf."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-04645-2_27","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2009","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Swap bribery. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 299\u2013310. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04645-2_27"},{"key":"7_CR14","unstructured":"Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Committee scoring rules: axiomatic classification and hierarchy. In: Proceedings of IJCAI-2016, pp. 250\u2013256 (2016)"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0165-4896(85)90043-5","volume":"10","author":"W Gehrlein","year":"1985","unstructured":"Gehrlein, W.: The Condorcet criterion and committee selection. Math. Soc. Sci. 10(3), 199\u2013209 (1985)","journal-title":"Math. Soc. Sci."},{"key":"7_CR16","unstructured":"Kaczmarczyk, A., Faliszewski, P.: Algorithms for destructive shift bribery. In: Proceedings of AAMAS-2016, pp. 305\u2013313 (2016)"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jmateco.2017.01.008","volume":"70","author":"E Kamwa","year":"2017","unstructured":"Kamwa, E.: On stable voting rules for selecting committees. J. Math. Econ. 70, 36\u201344 (2017)","journal-title":"J. Math. Econ."},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"7_CR19","unstructured":"Lu, T., Boutilier, C.: Budgeted social choice: from consensus to personalized decision making. In: Proceedings of IJCAI-2011, pp. 280\u2013286 (2011)"},{"key":"7_CR20","unstructured":"Magrino, T., Rivest, R., Shen, E., Wagner, D.: Computing the margin of victory in IRV elections. Presented at EVT\/WOTE-2011, August 2011"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-41575-3_20","volume-title":"Algorithmic Decision Theory","author":"Nicholas Mattei","year":"2013","unstructured":"Mattei, N., Walsh, T.: Preflib: a library for preferences. In: Proceedings of the 3rd International Conference on Algorithmic Decision Theory, pp. 259\u2013270 (2013)"},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"D McGarvey","year":"1953","unstructured":"McGarvey, D.: A theorem on the construction of voting paradoxes. Econometrica 21(4), 608\u2013610 (1953)","journal-title":"Econometrica"},{"issue":"3","key":"7_CR23","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00355-007-0235-2","volume":"30","author":"A Procaccia","year":"2008","unstructured":"Procaccia, A., Rosenschein, J., Zohar, A.: On the complexity of achieving proportional representation. Soc. Choice Welf. 30(3), 353\u2013362 (2008)","journal-title":"Soc. Choice Welf."},{"key":"7_CR24","unstructured":"Sekar, S. Sikdar., Xia, L.: Condorcet consistent bundling with social choice. In: Proceedings of AAMAS-2017, May 2017"},{"key":"7_CR25","unstructured":"Shiryaev, D., Yu, L., Elkind, E.: On elections with robust winners. In: Proceedings of AAMAS-2013, pp. 415\u2013422 (2013)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Xia, L.: Computing the margin of victory for various voting rules. In: Proceedings of EC-2012, pp. 982\u2013999, June 2012","DOI":"10.1145\/2229012.2229086"}],"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-319-66700-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:26:04Z","timestamp":1709828764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","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":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}