{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T14:45:23Z","timestamp":1746283523827,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030822538"},{"type":"electronic","value":"9783030822545"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-82254-5_14","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T22:02:32Z","timestamp":1626732152000},"page":"228-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Predicting Election Outcomes and Estimating Their Robustness"],"prefix":"10.1007","author":[{"given":"Dorothea","family":"Baumeister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Hogrebe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bachrach, Y., Betzler, N., Faliszewski, P.: Probabilistic possible winner determination. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp. 697\u2013702. AAAI Press (2010)","DOI":"10.1609\/aaai.v24i1.7609"},{"key":"14_CR3","unstructured":"Baumeister, D., Hogrebe, T.: Complexity of election evaluation and probabilistic robustness. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, pp. 1771\u20131773. IFAAMAS (2020)"},{"key":"14_CR4","unstructured":"Baumeister, D., Hogrebe, T.: Complexity of scheduling and predicting round-robin tournaments. In: Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems, pp. 178\u2013186. IFAAMAS (2021)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Baumeister, D., Hogrebe, T., Rey, L.: Generalized distance bribery. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, pp. 1764\u20131771. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33011764"},{"issue":"8","key":"14_CR6","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.jcss.2010.04.002","volume":"76","author":"N Betzler","year":"2010","unstructured":"Betzler, N., Dorn, B.: Towards a dichotomy of finding possible winners in elections based on scoring rules. J. Comput. Syst. Sci. 76(8), 812\u2013836 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR7","unstructured":"Boehmer, N., Bredereck, R., Faliszewski, P., Niedermeier, R.: On the robustness of winners: counting briberies in elections. arXiv preprint arXiv:2010.09678 (2020)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Rosenschein, J.: Incomplete information and communication in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) Handbook of Computational Social Choice, chap. 10, pp. 223\u2013257. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.011"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions. Order 8(3), 225\u2013242 (1991)","journal-title":"Order"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2892565","volume":"4","author":"I Caragiannis","year":"2016","unstructured":"Caragiannis, I., Procaccia, A., Shah, N.: When do noisy votes reveal the truth? ACM Trans. Econ. Comput. 4(3), 15 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"key":"14_CR11","unstructured":"Cohen, W., Schapire, R., Singer, Y.: Learning to order things. In: Advances in Neural Information Processing Systems, pp. 451\u2013457 (1998)"},{"key":"14_CR12","unstructured":"Conitzer, V., Sandholm, T.: Complexity of manipulating elections with few candidates. In: Proceedings of the 18th National Conference on Artificial Intelligence, pp. 314\u2013319. AAAI Press (2002)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0304-3975(92)90234-7","volume":"102","author":"P Dagum","year":"1992","unstructured":"Dagum, P., Luby, M.: Approximating the permanent of graphs with large factors. Theor. Comput. Sci. 102(2), 283\u2013305 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s00453-011-9568-4","volume":"64","author":"B Dorn","year":"2012","unstructured":"Dorn, B., Schlotter, I.: Multivariate complexity analysis of swap bribery. Algorithmica 64(1), 126\u2013151 (2012)","journal-title":"Algorithmica"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International Conference on World Wide Web, pp. 613\u2013622. ACM (2001)","DOI":"10.1145\/371920.372165"},{"key":"14_CR16","unstructured":"Ephrati, E., Rosenschein, J.: Multi-agent planning as a dynamic search for social consensus. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence, pp. 423\u2013429 (1993)"},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1137\/S0097539703427203","volume":"33","author":"J Flum","year":"2004","unstructured":"Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM J. Comput. 33(4), 892\u2013922 (2004)","journal-title":"SIAM J. Comput."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Mundhe, M., Hernandez, K., Sen, S.: Voting for movies: the anatomy of a recommender system. In: Proceedings of the 3rd Annual Conference on Autonomous Agents, pp. 434\u2013435. ACM (1999)","DOI":"10.1145\/301136.301303"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2012.04.009","volume":"189","author":"N Hazon","year":"2012","unstructured":"Hazon, N., Aumann, Y., Kraus, S., Wooldridge, M.: On the evaluation of election outcomes under uncertainty. Artif. Intell. 189, 1\u201318 (2012)","journal-title":"Artif. Intell."},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/S0097539793304601","volume":"27","author":"H Hunt","year":"1998","unstructured":"Hunt, H., Marathe, M., Radhakrishnan, V., Stearns, R.: The complexity of planar counting problems. SIAM J. Comput. 27(4), 1142\u20131167 (1998)","journal-title":"SIAM J. Comput."},{"key":"14_CR21","unstructured":"Imber, A., Kimelfeld, B.: Probabilistic inference of winners in elections by independent random voters. In: Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems, pp. 647\u2013655. IFAAMAS (2021)"},{"key":"14_CR22","unstructured":"Kendall, M.G.: Rank Correlation Methods. Theory & Applications of Rank Order-Statistics, 3rd edn. C. Griffin (1962)"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Kenig, B., Kimelfeld, B.: Approximate inference of outcomes in probabilistic elections. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, vol. 33, pp. 2061\u20132068. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33012061"},{"key":"14_CR24","first-page":"104","volume":"34","author":"D K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: Graphok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s a halmazok elm\u00e9let\u00e9re. Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi Ertesito 34, 104\u2013119 (1916)","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi Ertesito"},{"issue":"1","key":"14_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0020-0190(02)00455-6","volume":"86","author":"S Kwek","year":"2003","unstructured":"Kwek, S., Mehlhorn, K.: Optimal search for rationals. Inf. Process. Lett. 86(1), 23\u201326 (2003)","journal-title":"Inf. Process. Lett."},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Lang, J.: Collective decision making under incomplete knowledge: possible and necessary solutions. In: 29th International Joint Conference on Artificial Intelligence and 17th Pacific Rim International Conference on Artificial Intelligence, pp. 4885\u20134891. International Joint Conferences on Artificial Intelligence Organization (2020)","DOI":"10.24963\/ijcai.2020\/680"},{"issue":"1","key":"14_CR27","first-page":"3783","volume":"15","author":"T Lu","year":"2014","unstructured":"Lu, T., Boutilier, C.: Effective sampling and learning for Mallows models with pairwise-preference data. J. Mach. Learn. Res. 15(1), 3783\u20133829 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1093\/biomet\/44.1-2.114","volume":"44","author":"C Mallows","year":"1957","unstructured":"Mallows, C.: Non-null ranking models. Biometrika 44, 114\u2013130 (1957)","journal-title":"Biometrika"},{"issue":"4","key":"14_CR29","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.jal.2015.03.004","volume":"13","author":"N Mattei","year":"2015","unstructured":"Mattei, N., Goldsmith, J., Klapper, A., Mundhenk, M.: On the complexity of bribery and manipulation in tournaments with uncertain information. J. Appl. Log. 13(4), 557\u2013581 (2015)","journal-title":"J. Appl. Log."},{"key":"14_CR30","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"14_CR31","unstructured":"Shiryaev, D., Yu, L., Elkind, E.: On elections with robust winners. In: Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems, pp. 415\u2013422. IFAAMAS (2013)"},{"key":"14_CR32","unstructured":"Szufa, S., Faliszewski, P., Skowron, P., Slinko, A., Talmon, N.: Drawing a map of elections in the space of statistical cultures. In: Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, pp. 1341\u20131349. IFAAMAS (2020)"},{"issue":"5","key":"14_CR33","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865\u2013877 (1991)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"14_CR34","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theor. Comput. Sci. 8(2), 189\u2013201 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR35","unstructured":"Walsh, T.: Uncertainty in preference elicitation and aggregation. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence, pp. 3\u20138 (2007)"},{"key":"14_CR36","unstructured":"de Weerdt, M., Gerding, E., Stein, S.: Minimising the rank aggregation error. In: Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, pp. 1375\u20131376. IFAAMAS (2016)"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Wojtas, K., Faliszewski, P.: Possible winners in noisy elections. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, pp. 1499\u20131505. AAAI Press (2012)","DOI":"10.1609\/aaai.v26i1.8255"}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-82254-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T22:49:35Z","timestamp":1672872575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-82254-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030822538","9783030822545"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-82254-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUMAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eumas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/biu-ai.com\/EUMAS21\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"51","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":"16","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":"31% - 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.2","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":"3.05","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)"}}]}}