{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:54:17Z","timestamp":1774598057302,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T00:00:00Z","timestamp":1774569600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T00:00:00Z","timestamp":1774569600000},"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":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10458-026-09743-x","type":"journal-article","created":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:05:39Z","timestamp":1774595139000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of the two-stage majoritarian rule"],"prefix":"10.1007","volume":"40","author":[{"given":"Yongjie","family":"Yang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,27]]},"reference":[{"key":"9743_CR1","doi-asserted-by":"crossref","unstructured":"Yang, Y. (2023). On the complexity of two-stage majoritarian rules. In AAMAS (pp. 2022\u20132030). https:\/\/dl.acm.org\/doi\/10.5555\/3545946.3598875","DOI":"10.65109\/LHXQ3570"},{"key":"9743_CR2","doi-asserted-by":"publisher","unstructured":"Boehmer, N., Bredereck, R., Faliszewski, P., & Niedermeier, R. (2021). Winner robustness via swap- and shift-bribery: Parameterized counting complexity and experiments. In IJCAI (pp. 52\u201358). https:\/\/doi.org\/10.24963\/IJCAI.2021\/8","DOI":"10.24963\/IJCAI.2021\/8"},{"key":"9743_CR3","doi-asserted-by":"publisher","unstructured":"Elkind, E., Gan, J., Obraztsova, S., Rabinovich, Z., & Voudouris, A. A. (2021). Protecting elections by recounting ballots. Artificial Intelligence,290, Article 103401. https:\/\/doi.org\/10.1016\/J.ARTINT.2020.103401","DOI":"10.1016\/J.ARTINT.2020.103401"},{"key":"9743_CR4","doi-asserted-by":"publisher","unstructured":"Fitzsimmons, Z., & Hemaspaandra, E. (2022). Insight into voting problem complexity using randomized classes. In IJCAI (pp. 293\u2013299). https:\/\/doi.org\/10.24963\/IJCAI.2022\/42","DOI":"10.24963\/IJCAI.2022\/42"},{"key":"9743_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/J.JCSS.2022.01.006","volume":"127","author":"E Hemaspaandra","year":"2022","unstructured":"Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2022). The complexity of online bribery in sequential elections. Journal of Computer and System Sciences, 127, 66\u201390. https:\/\/doi.org\/10.1016\/J.JCSS.2022.01.006","journal-title":"Journal of Computer and System Sciences"},{"key":"9743_CR6","doi-asserted-by":"publisher","unstructured":"Neveling, M., & Rothe, J. (2021). Control complexity in Borda elections: Solving all open cases of offline control and some cases of online control. Artificial Intelligence,298, Article 103508. https:\/\/doi.org\/10.1016\/j.artint.2021.103508","DOI":"10.1016\/j.artint.2021.103508"},{"key":"9743_CR7","doi-asserted-by":"publisher","unstructured":"Bartholdi III, J. J., Tovey, C. A., & Trick, M. A. (1992). How hard is it to control an election? Mathematical and Computer Modelling,16(8\u20139), 27\u201340. https:\/\/doi.org\/10.1016\/0895-7177(92)90085-Y","DOI":"10.1016\/0895-7177(92)90085-Y"},{"key":"9743_CR8","doi-asserted-by":"publisher","unstructured":"Bartholdi III, J. J., Tovey, C. A., & Trick, M. A. (1989). The computational difficulty of manipulating an election. Social Choice and Welfare,6(3), 227\u2013241. https:\/\/doi.org\/10.1007\/BF00295861","DOI":"10.1007\/BF00295861"},{"key":"9743_CR9","doi-asserted-by":"publisher","unstructured":"Baumeister, D., & Rothe, J. (2016). Preference aggregation by voting. In Rothe, J. (ed.) Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division (pp. 197\u2013325). Springer, Chap. 4. https:\/\/doi.org\/10.1007\/978-3-662-47904-9_4","DOI":"10.1007\/978-3-662-47904-9_4"},{"key":"9743_CR10","doi-asserted-by":"publisher","unstructured":"Faliszewski, P., & Rothe, J. (2016). Control and bribery in voting. In Brandt, F., Conitzer, V., Endriss, U., Lang, J., & Procaccia, A. (eds.) Handbook of Computational Social Choice, (pp. 146\u2013168). Cambridge University Press, Chap. 7. https:\/\/doi.org\/10.1017\/CBO9781107446984.008","DOI":"10.1017\/CBO9781107446984.008"},{"issue":"2","key":"9743_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.3982\/TE4712","volume":"17","author":"S Horan","year":"2022","unstructured":"Horan, S., & Sprumont, Y. (2022). Two-stage majoritarian choice. Theoretical Economics, 17(2), 521\u2013537. https:\/\/doi.org\/10.3982\/TE4712","journal-title":"Theoretical Economics"},{"key":"9743_CR12","doi-asserted-by":"crossref","unstructured":"Rasch, B.E. (2000). Parliamentary floor voting procedures and agenda setting in Europe. Legislative Studies Quarterly,25(1), 3\u201323. https:\/\/www.jstor.org\/stable\/440391","DOI":"10.2307\/440391"},{"issue":"27\u201329","key":"9743_CR13","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1016\/j.tcs.2009.04.004","volume":"410","author":"H Liu","year":"2009","unstructured":"Liu, H., Feng, H., Zhu, D., & Luan, J. (2009). Parameterized computational complexity of control problems in voting systems. Theoretical Computer Science, 410(27\u201329), 2746\u20132753. https:\/\/doi.org\/10.1016\/j.tcs.2009.04.004","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"9743_CR14","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/s00453-025-01304-0","volume":"87","author":"Y Yang","year":"2025","unstructured":"Yang, Y. (2025). On the complexity of controlling amendment and successive winners. Algorithmica, 87(6), 842\u2013907. https:\/\/doi.org\/10.1007\/s00453-025-01304-0","journal-title":"Algorithmica"},{"key":"9743_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1613\/jair.5407","volume":"59","author":"R Bredereck","year":"2017","unstructured":"Bredereck, R., Chen, J., Niedermeier, R., & Walsh, T. (2017). Parliamentary voting procedures: Agenda control, manipulation, and uncertainty. Journal of Artificial Intelligence Research, 59, 133\u2013173. https:\/\/doi.org\/10.1613\/jair.5407","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9743_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-4225-7","author":"D Black","year":"1958","unstructured":"Black, D. (1958). The Theory of Committees and Elections. Cambridge University Press, London. https:\/\/doi.org\/10.1007\/978-94-009-4225-7","journal-title":"Cambridge University Press, London."},{"key":"9743_CR17","doi-asserted-by":"publisher","first-page":"769","DOI":"10.2307\/2110736","volume":"21","author":"NR Miller","year":"1977","unstructured":"Miller, N. R. (1977). Graph-theoretical approaches to the theory of voting. American Journal of Political Science, 21, 769\u2013803. https:\/\/doi.org\/10.2307\/2110736","journal-title":"American Journal of Political Science"},{"key":"9743_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.05.002","volume":"262","author":"H Aziz","year":"2018","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Mattei, N., Stursberg, P., & Walsh, T. (2018). Fixing balanced knockout and double elimination tournaments. Artificial Intelligence, 262, 1\u201314. https:\/\/doi.org\/10.1016\/j.artint.2018.05.002","journal-title":"Artificial Intelligence"},{"key":"9743_CR19","unstructured":"Conitzer, V., Lang, J., & Xia, L. (2009). How hard is it to control sequential elections via the agenda? In IJCAI (pp. 103\u2013108). https:\/\/dl.acm.org\/doi\/10.5555\/1661445.1661463"},{"key":"9743_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/J.DAM.2023.06.012","volume":"339","author":"P Manurangsi","year":"2023","unstructured":"Manurangsi, P., & Suksompong, W. (2023). Fixing knockout tournaments with seeds. Discrete Applied Mathematics, 339, 21\u201335. https:\/\/doi.org\/10.1016\/J.DAM.2023.06.012","journal-title":"Discrete Applied Mathematics"},{"key":"9743_CR21","doi-asserted-by":"publisher","unstructured":"Williams, V.V. (2010). Fixing a tournament. In AAAI (pp. 895\u2013900). https:\/\/doi.org\/10.1609\/AAAI.V24I1.7617","DOI":"10.1609\/AAAI.V24I1.7617"},{"key":"9743_CR22","doi-asserted-by":"publisher","unstructured":"Williams, V.V. (2016). Knockout tournaments. In Brandt, F., Conitzer, V., Endriss, U., Lang, J., & Procaccia, A. (eds.) Handbook of Computational Social Choice, (pp. 453\u2013474). Cambridge University Press, Chap. 19. https:\/\/doi.org\/10.1017\/CBO9781107446984.020","DOI":"10.1017\/CBO9781107446984.020"},{"issue":"3","key":"9743_CR23","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. (2007). When are elections with few candidates hard to manipulate? Journal of the ACM, 54(3), 14. https:\/\/doi.org\/10.1145\/1236457.1236461","journal-title":"Journal of the ACM"},{"key":"9743_CR24","doi-asserted-by":"publisher","unstructured":"Conitzer, V., & Walsh, T. (2016). Barriers to manipulation in voting. In Brandt, F., Conitzer, V., Endriss, U., Lang, J., & Procaccia, A. (eds.) Handbook of Computational Social Choice, (pp. 127\u2013145). Cambridge University Press, Chap. 6. https:\/\/doi.org\/10.1017\/CBO9781107446984.007","DOI":"10.1017\/CBO9781107446984.007"},{"issue":"3","key":"9743_CR25","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1134\/S0005117916030012","volume":"77","author":"YA Veselova","year":"2016","unstructured":"Veselova, Y. A. (2016). Computational complexity of manipulation: A survey. Automation and Remote Control, 77(3), 369\u2013388. https:\/\/doi.org\/10.1134\/S0005117916030012","journal-title":"Automation and Remote Control"},{"issue":"1\u20132","key":"9743_CR26","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10472-011-9255-9","volume":"62","author":"T Walsh","year":"2011","unstructured":"Walsh, T. (2011). Is computational complexity a barrier to manipulation? Annals of Mathematics and Artificial Intelligence, 62(1\u20132), 7\u201326. https:\/\/doi.org\/10.1007\/s10472-011-9255-9","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9743_CR27","unstructured":"Walsh, T. (2011). Where are the hard manipulation problems? Journal of Artificial Intelligence Research,42, 1\u201329. https:\/\/www.jair.org\/index.php\/jair\/article\/view\/10720"},{"issue":"5\u20136","key":"9743_CR28","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.artint.2007.01.005","volume":"171","author":"E Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L. A., & Rothe, J. (2007). Anyone but him: The complexity of precluding an alternative. Artificial Intelligence, 171(5\u20136), 255\u2013285. https:\/\/doi.org\/10.1016\/j.artint.2007.01.005","journal-title":"Artificial Intelligence"},{"key":"9743_CR29","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1613\/JAIR.1.15483","volume":"81","author":"B Carleton","year":"2024","unstructured":"Carleton, B., Chavrimootoo, M. C., Hemaspaandra, L. A., Narv\u00e1ez, D. E., Taliancich, C., & Welles, H. B. (2024). Separating and collapsing electoral control types. Journal of Artificial Intelligence Research, 81, 71\u2013116. https:\/\/doi.org\/10.1613\/JAIR.1.15483","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9743_CR30","doi-asserted-by":"crossref","unstructured":"Carleton, B., Chavrimootoo, M.C., Hemaspaandra, L.A., Narv\u00e1ez, D.E., Taliancich, C., & Welles, H.B. (2023). Search versus search for collapsing electoral control types. In AAMAS (pp. 2682\u20132684). https:\/\/dl.acm.org\/doi\/10.5555\/3545946.3599042","DOI":"10.65109\/OHCO7123"},{"issue":"2","key":"9743_CR31","doi-asserted-by":"publisher","first-page":"41","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. (2021). Towards completing the puzzle: Complexity of control by replacing, adding, and deleting candidates or voters. Autonomous Agent Multi-Agent, 35(2), 41. https:\/\/doi.org\/10.1007\/s10458-021-09523-9","journal-title":"Autonomous Agent Multi-Agent Systems"},{"key":"9743_CR32","doi-asserted-by":"crossref","unstructured":"Yang, Y. (2017). The complexity of control and bribery in majority judgment. In AAMAS (pp. 1169\u20131177). https:\/\/dl.acm.org\/doi\/10.5555\/3091125.3091288","DOI":"10.65109\/FLZD6214"},{"key":"9743_CR33","doi-asserted-by":"crossref","unstructured":"Yang, Y. (2017). On the complexity of Borda control in single-peaked elections. In AAMAS (pp. 1178\u20131186). https:\/\/dl.acm.org\/doi\/10.5555\/3091125.3091289","DOI":"10.65109\/RKIS7240"},{"key":"9743_CR34","doi-asserted-by":"publisher","unstructured":"Yang, Y. (2020). On the complexity of constructive control under nearly single-peaked preferences. In ECAI (pp. 243\u2013250). https:\/\/doi.org\/10.3233\/FAIA200099","DOI":"10.3233\/FAIA200099"},{"key":"9743_CR35","unstructured":"Konczak, K., & Lang, J. (2005). Voting procedures with incomplete preferences. In M-PREF. http:\/\/www.eecs.harvard.edu\/cs286r\/courses\/fall11\/papers\/KL05.pdf"},{"issue":"3","key":"9743_CR36","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/3458472","volume":"2","author":"V Chakraborty","year":"2021","unstructured":"Chakraborty, V., Delemazure, T., Kimelfeld, B., Kolaitis, P. G., Relia, K., & Stoyanovich, J. (2021). Algorithmic techniques for necessary and possible winners. Transformative Data Science, 2(3), 22. https:\/\/doi.org\/10.1145\/3458472","journal-title":"Transformative Data Science"},{"key":"9743_CR37","doi-asserted-by":"publisher","unstructured":"Chakraborty, V., & Kolaitis, P.G. (2021). Classifying the complexity of the possible winner problem on partial chains. In AAMAS (pp. 297\u2013305). https:\/\/doi.org\/10.5555\/3463952.3463992","DOI":"10.5555\/3463952.3463992"},{"key":"9743_CR38","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1613\/JAIR.3186","volume":"41","author":"L Xia","year":"2011","unstructured":"Xia, L., & Conitzer, V. (2011). Determining possible and necessary winners given partial orders. Journal of Artificial Intelligence Research, 41, 25\u201367. https:\/\/doi.org\/10.1613\/JAIR.3186","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9743_CR39","doi-asserted-by":"publisher","unstructured":"Bang-Jensen, J., Gutin, G.Z. (eds.) (2018). Classes of Directed Graphs. Springer Monographs in Mathematics. Springer. https:\/\/doi.org\/10.1007\/978-3-319-71840-8","DOI":"10.1007\/978-3-319-71840-8"},{"key":"9743_CR40","doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F. V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., & Saurabh, S. (2015). Parameterized Algorithms. Springer. https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"9743_CR41","doi-asserted-by":"publisher","unstructured":"Downey, R. (2012). A parameterized complexity tutorial. In LATA (pp. 38\u201356). https:\/\/doi.org\/10.1007\/978-3-642-28332-1_4","DOI":"10.1007\/978-3-642-28332-1_4"},{"issue":"3","key":"9743_CR42","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/inte.32.3.30.39","volume":"32","author":"CA Tovey","year":"2002","unstructured":"Tovey, C. A. (2002). Tutorial on computational complexity. Interfaces, 32(3), 30\u201361. https:\/\/doi.org\/10.1287\/inte.32.3.30.39","journal-title":"Interfaces"},{"key":"9743_CR43","doi-asserted-by":"publisher","unstructured":"Sornat, K., Vassilevska Williams, V., & Xu, Y. (2021). Fine-grained complexity and algorithms for the Schulze voting method. In EC (pp. 841\u2013859). https:\/\/doi.org\/10.1145\/3465456.3467630","DOI":"10.1145\/3465456.3467630"},{"issue":"5","key":"9743_CR44","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(91)90071-O","volume":"38","author":"J Matou\u0161ek","year":"1991","unstructured":"Matou\u0161ek, J. (1991). Computing dominances in $${E}^n$$. Information Processing Letters, 38(5), 277\u2013278. https:\/\/doi.org\/10.1016\/0020-0190(91)90071-O","journal-title":"Information Processing Letters"},{"key":"9743_CR45","doi-asserted-by":"publisher","unstructured":"Alman, J., & Vassilevska Williams, V. (2024). A refined laser method and faster matrix multiplication. TheoretiCS,3, 21. https:\/\/doi.org\/10.46298\/THEORETICS.24.21","DOI":"10.46298\/THEORETICS.24.21"},{"key":"9743_CR46","volume-title":"Theory of Voting","author":"R Farquharson","year":"1969","unstructured":"Farquharson, R. (1969). Theory of Voting. New Haven, USA: Yale University Press."},{"key":"9743_CR47","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York: W. H."},{"key":"9743_CR48","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R., & Stege, U. (1999). Parameterized complexity: A framework for systematically confronting computational intractability. In Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future (pp. 49\u201399).","DOI":"10.1090\/dimacs\/049\/04"},{"issue":"4","key":"9743_CR49","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"DC McGarvey","year":"1953","unstructured":"McGarvey, D. C. (1953). A theorem on the construction of voting paradoxes. Econometrica, 21(4), 608\u2013610. https:\/\/doi.org\/10.2307\/1907926","journal-title":"Econometrica"},{"key":"9743_CR50","unstructured":"Betzler, B., Hemmann, S., & Niedermeier, R. (2009). A multivariate complexity analysis of determining possible winners given incomplete votes. In IJCAI (pp. 53\u201358). https:\/\/www.ijcai.org\/Proceedings\/09\/Papers\/020.pdf"},{"key":"9743_CR51","doi-asserted-by":"publisher","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., & Saurabh, S. (2015). Lower Bounds Based on the Exponential-Time Hypothesis. In Parameterized Algorithms, (pp. 467\u2013521). Springer, https:\/\/doi.org\/10.1007\/978-3-319-21275-3_14","DOI":"10.1007\/978-3-319-21275-3_14"},{"issue":"2","key":"9743_CR52","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2650261","volume":"11","author":"M Dom","year":"2014","unstructured":"Dom, M., Lokshtanov, D., & Saurabh, S. (2014). Kernelization lower bounds through colors and IDs. ACM Transactions on Algorithms, 11(2), 13. https:\/\/doi.org\/10.1145\/2650261","journal-title":"ACM Transactions on Algorithms"},{"key":"9743_CR53","doi-asserted-by":"publisher","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., & Yeo, A. (2009). Kernel bounds for disjoint cycles and disjoint paths. In ESA (pp. 635\u2013646). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_57","DOI":"10.1007\/978-3-642-04128-0_57"},{"issue":"8","key":"9743_CR54","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.jcss.2006.04.007","volume":"72","author":"J Chen","year":"2006","unstructured":"Chen, J., Huang, X., Kanj, I. A., & Xia, G. (2006). Strong computational lower bounds via parameterized complexity. Journal of Computer and System Sciences, 72(8), 1346\u20131367. https:\/\/doi.org\/10.1016\/j.jcss.2006.04.007","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"9743_CR55","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U. (1998). A threshold of ln n for approximating set cover. Journal of the ACM, 45(4), 634\u2013652. https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"Journal of the ACM"},{"key":"9743_CR56","doi-asserted-by":"publisher","unstructured":"Dinur, I., & Steurer, D. (2014). Analytical approach to parallel repetition. In STOC (pp. 624\u2013633). https:\/\/doi.org\/10.1145\/2591796.2591884","DOI":"10.1145\/2591796.2591884"},{"key":"9743_CR57","doi-asserted-by":"publisher","unstructured":"Elkind, E., Lackner, M., & Peters, D. (2022). Preference restrictions in computational social choice: A survey. CoRR. https:\/\/doi.org\/10.48550\/arXiv.2205.09092","DOI":"10.48550\/arXiv.2205.09092"},{"issue":"9","key":"9743_CR58","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1134\/S0005117922090016","volume":"83","author":"AV Karpov","year":"2022","unstructured":"Karpov, A. V. (2022). Structured preferences: A literature survey. Automation and Remote Control, 83(9), 1329\u20131354. https:\/\/doi.org\/10.1134\/S0005117922090016","journal-title":"Automation and Remote Control"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-026-09743-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-026-09743-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-026-09743-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:05:45Z","timestamp":1774595145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-026-09743-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,27]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9743"],"URL":"https:\/\/doi.org\/10.1007\/s10458-026-09743-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,27]]},"assertion":[{"value":"30 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}}],"article-number":"17"}}