{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:50:53Z","timestamp":1753739453559,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"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-87756-9_14","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"209-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strategic Voting in Negotiating Teams"],"prefix":"10.1007","author":[{"given":"Leora","family":"Schmerler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noam","family":"Hazon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.2307\/2118502","volume":"108","author":"N Anbarci","year":"1993","unstructured":"Anbarci, N.: Noncooperative foundations of the area monotonic solution. Q. J. Econ. 108(1), 245\u2013258 (1993)","journal-title":"The Quarterly Journal of Economics"},{"doi-asserted-by":"publisher","unstructured":"Bartholdi, J.J., Orlin, J.B.: Single transferable vote resists strategic voting. Soc. Choice Welfare 8(4), 341\u2013354 (1991). https:\/\/doi.org\/10.1007\/BF00183045","key":"14_CR2","DOI":"10.1007\/BF00183045"},{"doi-asserted-by":"publisher","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227\u2013241 (1989). https:\/\/doi.org\/10.1007\/BF00295861","key":"14_CR3","DOI":"10.1007\/BF00295861"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.geb.2014.01.015","volume":"85","author":"W Bossert","year":"2014","unstructured":"Bossert, W., Sprumont, Y.: Strategy-proof preference aggregation: possibilities and characterizations. Games Econ. Behav. 85, 109\u2013126 (2014)","journal-title":"Games and Economic Behavior"},{"doi-asserted-by":"publisher","unstructured":"Bossert, W., Storcken, T.: Strategy-proofness of social welfare functions: the use of the kemeny distance between preference orderings. Soc. Choice and Welfare 9(4), 345\u2013360 (1992). https:\/\/doi.org\/10.1007\/BF00182575","key":"14_CR5","DOI":"10.1007\/BF00182575"},{"key":"14_CR6","volume-title":"Negotiation Games: Applying Game Theory to Bargaining and Arbitration","author":"SJ Brams","year":"2003","unstructured":"Brams, S.J.: Negotiation Games: Applying Game Theory to Bargaining and Arbitration, vol. 2. Psychology Press, Hove (2003)"},{"doi-asserted-by":"crossref","unstructured":"Bredereck, R., Kaczmarczyk, A., Niedermeier, R.: On coalitional manipulation for multiwinner elections: shortlisting. In: Proceedings of IJCAI-2017, pp. 887\u2013893 (2017)","key":"14_CR7","DOI":"10.24963\/ijcai.2017\/123"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1037\/1089-2699.5.3.208","volume":"5","author":"S Brodt","year":"2001","unstructured":"Brodt, S., Thompson, L.: Negotiating teams: a levels of analysis approach. Group Dyn. Theor. Res. Pract. 5(3), 208\u2013219 (2001)","journal-title":"Group Dynamics: Theory, Research, and Practice"},{"unstructured":"Conitzer, V., Sandholm, T.: Universal voting protocol tweaks to make manipulation hard. In: Proceedings of IJCAI, pp. 781\u2013788 (2003)","key":"14_CR9"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1236457.1236461","volume":"54","author":"V Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM (JACM) 54(3), 14 (2007)","journal-title":"Journal of the ACM (JACM)"},{"doi-asserted-by":"crossref","unstructured":"Conitzer, V., Walsh, T.: Barriers to manipulation in voting. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, pp. 127\u2013145. Cambridge University Press (2016)","key":"14_CR11","DOI":"10.1017\/CBO9781107446984.007"},{"doi-asserted-by":"crossref","unstructured":"Davies, J., Narodytska, N., Walsh, T.: Eliminating the weakest link: making manipulation intractable? In: Proceedings of AAAI, pp. 1333\u20131339 (2012)","key":"14_CR12","DOI":"10.1609\/aaai.v26i1.8254"},{"unstructured":"Dogan, O., Lain\u00e9, J.: Strategic manipulation of social welfare functions via strict preference extensions. In: The 13th Meeting of the Society for Social Choice and Welfare, p. 199 (2016)","key":"14_CR13"},{"doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of WWW, pp. 613\u2013622 (2001)","key":"14_CR14","DOI":"10.1145\/371920.372165"},{"doi-asserted-by":"publisher","unstructured":"Elkind, E., Lipmaa, H.: Hybrid voting protocols and hardness of manipulation. In: Deng, X., Du, D.Z. (eds.) Algorithms and Computation, vol. 3827, pp. 206\u2013215. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11602613_22","key":"14_CR15","DOI":"10.1007\/11602613_22"},{"unstructured":"Ephrati, E., Rosenschein, J.S., et al.: Multi-agent planning as a dynamic search for social consensus. In: Proceedings of IJCAI, pp. 423\u2013429 (1993)","key":"14_CR16"},{"doi-asserted-by":"crossref","unstructured":"Erlich, S., Hazon, N., Kraus, S.: Negotiation strategies for agents with ordinal preferences. In: Proceedings of IJCAI, pp. 210\u2013218 (2018)","key":"14_CR17","DOI":"10.24963\/ijcai.2018\/29"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v31i4.2314","volume":"31","author":"P Faliszewski","year":"2010","unstructured":"Faliszewski, P., Procaccia, A.D.: AI\u2019s war on manipulation: are we winning? AI Mag. 31(4), 53\u201364 (2010)","journal-title":"AI Magazine"},{"key":"14_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511751691","volume-title":"Principles of Automated Negotiation","author":"S Fatima","year":"2014","unstructured":"Fatima, S., Kraus, S., Wooldridge, M.: Principles of Automated Negotiation. Cambridge University Press, Cambridge (2014)."},{"issue":"4","key":"14_CR20","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"},{"doi-asserted-by":"publisher","unstructured":"K\u0131br\u0131s, \u00d6., Sertel, M.R.: Bargaining over a finite set of alternatives. Soc. Choice Welfare 28(3), 421\u2013437 (2007). https:\/\/doi.org\/10.1007\/s00355-006-0178-z","key":"14_CR21","DOI":"10.1007\/s00355-006-0178-z"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1613\/jair.2566","volume":"33","author":"R Meir","year":"2008","unstructured":"Meir, R., Procaccia, A.D., Rosenschein, J.S., Zohar, A.: Complexity of strategic behavior in multi-winner elections. J. Artif. Intell. Res. 33, 149\u2013178 (2008)","journal-title":"Journal of Artificial Intelligence Research"},{"unstructured":"Narodytska, N., Walsh, T.: Manipulating two stage voting rules. In: Proceedings of AAMAS, pp. 423\u2013430 (2013)","key":"14_CR23"},{"unstructured":"Obraztsova, S., Zick, Y., Elkind, E.: On manipulation in multi-winner elections based on scoring rules. In: Proceedings of AAMAS, pp. 359\u2013366 (2013)","key":"14_CR24"},{"unstructured":"S\u00e1nchez-Anguix, V., Botti, V., Juli\u00e1n, V., Garc\u00eda-Fornes, A.: Analyzing intra-team strategies for agent-based negotiation teams. In: Proceedings of AAMAS, pp. 929\u2013936 (2011)","key":"14_CR25"},{"doi-asserted-by":"crossref","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)","key":"14_CR26","DOI":"10.1016\/0022-0531(75)90050-2"},{"doi-asserted-by":"crossref","unstructured":"Schmerler, L., Hazon, N.: Strategic voting in the context of negotiating teams. arXiv preprint arXiv:2107.14097 (2021)","key":"14_CR27","DOI":"10.1007\/978-3-031-15714-1_32"},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.tcs.2016.02.003","volume":"622","author":"Y Yang","year":"2016","unstructured":"Yang, Y., Guo, J.: Exact algorithms for weighted and unweighted borda manipulation problems. Theor. Comput. Sci. 622, 79\u201389 (2016)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"publisher","unstructured":"Yu, W., Hoogeveen, H., Lenstra, J.K.: Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. J. Sched. 7(5), 333\u2013348 (2004). https:\/\/doi.org\/10.1023\/B:JOSH.0000036858.59787.c2","key":"14_CR29","DOI":"10.1023\/B:JOSH.0000036858.59787.c2"},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.artint.2008.11.005","volume":"173","author":"M Zuckerman","year":"2009","unstructured":"Zuckerman, M., Procaccia, A.D., Rosenschein, J.S.: Algorithms for the coalitional manipulation problem. Artif. Intell. 173(2), 392\u2013412 (2009)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:44Z","timestamp":1673647304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_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":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","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":"58","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":"27","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)"}}]}}