{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:23:22Z","timestamp":1743135802662,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_17","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"235-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Possible and Necessary Winner Problems in Iterative Elections with Multiple Rules"],"prefix":"10.1007","author":[{"given":"Peihua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiong","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"17_CR1","first-page":"42","volume":"39","author":"J Baldwin","year":"1926","unstructured":"Baldwin, J.: The technique of the Nanson preferential majority system of election. Proc. Royal Soc. Victoria 39, 42\u201352 (1926)","journal-title":"Proc. Royal Soc. Victoria"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"17_CR3","unstructured":"Baumeister, D., Selker, A.-K., Wilczynski, A.: Manipulation of opinion polls to influence iterative elections. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2020, pp. 132\u2013140 (2020)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chakraborty, V., Delemazure, T., Kimelfeld, B., Kolaitis, P.G., Relia, K., Stoyanovich, J.: Algorithmic techniques for necessary and possible winners. Trans. Data Sci. 2(3):22:1\u201322:23 (2021)","DOI":"10.1145\/3458472"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10458-021-09523-9","volume":"35","author":"G Erd\u00e9lyi","year":"2021","unstructured":"Erd\u00e9lyi, G., Neveling, M., Reger, C., Rothe, J., Yang, Y., Zorn, R.: Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agents Multi-Agent Syst. 35(2), 1\u201348 (2021). https:\/\/doi.org\/10.1007\/s10458-021-09523-9","journal-title":"Auton. Agents Multi-Agent Syst."},{"key":"17_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103520","volume":"298","author":"P Faliszewski","year":"2021","unstructured":"Faliszewski, P., Manurangsi, P., Sornat, K.: Approximation and hardness of shift-bribery. Artif. Intell. 298, 103520 (2021)","journal-title":"Artif. Intell."},{"key":"17_CR7","unstructured":"Gaspers, S., Naroditskiy, V., Narodytska, N., Walsh, T.: Possible and necessary winner problem in social polls. In: Proceedings of the 13th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2014, pp. 613\u2013620 (2014)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Levin, J., Nalebuff, B.: An introduction to voteacounting schemes. J. Econ. Perspect. 3\u201326 (1995)","DOI":"10.1257\/jep.9.1.3"},{"key":"17_CR9","unstructured":"Maushagen, C., Neveling, M., Rothe, J., Selker, A.-K.: Complexity of shift bribery in iterative elections. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, pp. 1567\u20131575, 2018"},{"key":"17_CR10","unstructured":"Nanson, E.: Methords of election. In: Transactions and Proceedings of the Royal Society of Victoria, pp. 197\u2013240 (1882)"},{"key":"17_CR11","unstructured":"Taylor, A., Pacelli, A.: Mathematics and Politics: Strategy. Power, and Proof. Springer Science and Business Media, Voting (2008)"},{"key":"17_CR12","unstructured":"Xia, L., Conitzer, V.: Determining possible and necessary winners under common voting rules given partial orders. In: Proceedings of the 23th International Conference on Artificial Intelligence, AAAI 2008, pp. 196\u2013201 (2008)"},{"key":"17_CR13","unstructured":"Zhou, A., Guo, J.: Parameterized complexity of shift bribery in iterative elections. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2020, pp. 1665\u20131673 (2020)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:49:40Z","timestamp":1672552180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"19","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":"76% - 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":"3","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)"}}]}}