Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability
We study the parameterized complexity of winner determination problems for three prevalent k -committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin–Courant’s approval voting (CCAV). It is known that these problems are computat...
Gespeichert in:
| Veröffentlicht in: | Autonomous agents and multi-agent systems Jg. 37; H. 2; S. 28 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Springer US
01.12.2023
Springer Nature B.V |
| Schlagworte: | |
| ISSN: | 1387-2532, 1573-7454 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We study the parameterized complexity of winner determination problems for three prevalent
k
-committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin–Courant’s approval voting (CCAV). It is known that these problems are computationally hard. Although they have been studied from the parameterized complexity point of view with respect to several natural parameters, many of them turned out to be W[1]-hard or W[2]-hard. Aiming at obtaining plentiful fixed-parameter algorithms, we revisit these problems by considering more natural single parameters, combined parameters, and structural parameters. |
|---|---|
| AbstractList | We study the parameterized complexity of winner determination problems for three prevalent
k
-committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin–Courant’s approval voting (CCAV). It is known that these problems are computationally hard. Although they have been studied from the parameterized complexity point of view with respect to several natural parameters, many of them turned out to be -hard or -hard. Aiming at obtaining plentiful fixed-parameter algorithms, we revisit these problems by considering more natural single parameters, combined parameters, and structural parameters. We study the parameterized complexity of winner determination problems for three prevalent k-committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin–Courant’s approval voting (CCAV). It is known that these problems are computationally hard. Although they have been studied from the parameterized complexity point of view with respect to several natural parameters, many of them turned out to be W[1]-hard or W[2]-hard. Aiming at obtaining plentiful fixed-parameter algorithms, we revisit these problems by considering more natural single parameters, combined parameters, and structural parameters. We study the parameterized complexity of winner determination problems for three prevalent k -committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin–Courant’s approval voting (CCAV). It is known that these problems are computationally hard. Although they have been studied from the parameterized complexity point of view with respect to several natural parameters, many of them turned out to be W[1]-hard or W[2]-hard. Aiming at obtaining plentiful fixed-parameter algorithms, we revisit these problems by considering more natural single parameters, combined parameters, and structural parameters. |
| ArticleNumber | 28 |
| Author | Yang, Yongjie Wang, Jianxin |
| Author_xml | – sequence: 1 givenname: Yongjie orcidid: 0000-0002-7731-6818 surname: Yang fullname: Yang, Yongjie email: yyongjiecs@gmail.com organization: Chair of Economic Theory, Saarland University – sequence: 2 givenname: Jianxin surname: Wang fullname: Wang, Jianxin organization: School of Computer Science and Engineering, Central South University, Xiangjiang Laboratory |
| BookMark | eNp9kE9PAyEQxYmpiVr9Ap5IPKMDLCz1Zoz_EhM96JlQYA1md6lAY-2nl1qNiQdPM4f3ezPvHaDJGEeP0DGFUwrQnmUKjVAEGCcwkxTIegftU9Fy0jaimdSdq5YwwdkeOsj5FYBKJuk-enk0yQy--BTW3mEbh0XvV6F84NjhYdmX8B7G0SfsNpohjKaEOJ7jISaPfdfFVHCJ7ya5jLuw8o4sfgxxScYWMw99tTtEu53psz_6nlP0fH31dHlL7h9u7i4v7onlkhdilOg4dYy1VAI1ci6tEJ7NnVKqMaA4o0xRkHTW1gTUOtYACAvCNTPrlOVTdLL1XaT4tvS56Ne4TGM9qTkTDeMgFVSV2qpsijkn32kbyley-nPoNQW9qVVva9W1Vv1Vq15XlP1BFykMJn38D_EtlKt4fPHp96t_qE81OY6P |
| CitedBy_id | crossref_primary_10_1145_3749377 |
| Cites_doi | 10.1016/j.artint.2016.09.003 10.1287/moor.8.4.538 10.1007/978-3-031-09016-5 10.1016/j.dam.2019.01.027 10.24963/ijcai.2021/31 10.1016/0304-3975(93)90064-Z 10.1186/s13015-022-00213-z 10.1007/978-3-642-30891-8_12 10.1007/978-3-642-20441-8_12 10.1609/aaai.v35i6.16722 10.1007/s00355-007-0235-2 10.1137/130947374 10.1007/978-3-319-13129-0_15 10.1007/s11127-007-9165-x 10.1613/jair.1.11253 10.1016/j.artint.2020.103403 10.1145/301136.301303 10.1007/978-3-642-02839-7_6 10.1016/S0020-0190(02)00434-9 10.1007/11534273_5 10.24963/ijcai.2019/90 10.1016/0304-3975(76)90059-1 10.1007/3-540-54233-7_162 10.1613/jair.1.11732 10.1007/978-3-319-94776-1_62 10.1007/978-3-031-20614-6_8 10.1007/BFb0045375 10.1613/jair.3896 10.1006/inco.1997.2697 10.1609/aaai.v28i1.8823 10.1016/0196-6774(86)90023-4 10.1609/aaai.v32i1.11460 10.1613/jair.5628 10.1609/aaai.v30i1.10049 10.1016/j.jcss.2017.06.004 10.1007/s00355-018-1126-4 10.1137/1.9780898719796 10.1016/j.tcs.2020.01.017 10.1006/jagm.1995.1037 10.1007/s10732-018-9376-y 10.1093/comjnl/bxm086 10.1007/s00453-017-0297-1 10.1609/aaai.v34i02.5551 10.1007/s00355-017-1026-z 10.1007/s00355-016-1019-3 10.1016/0304-3975(94)00097-3 10.1016/j.jet.2020.105173 10.1016/j.tcs.2014.12.012 10.1007/978-1-4471-5559-1 10.1016/j.ic.2017.10.002 10.24963/ijcai.2019/91 10.1109/TST.2014.6867519 10.1007/978-3-319-21275-3 10.2307/1957270 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2023 The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2023 – notice: The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L6V M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.1007/s10458-023-09610-z |
| DatabaseName | Springer Nature OA Free Journals CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central ProQuest Technology Collection ProQuest One ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection Engineering Database ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | CrossRef Computer Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1573-7454 |
| ExternalDocumentID | 10_1007_s10458_023_09610_z |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 62172446 funderid: http://dx.doi.org/10.13039/501100001809 – fundername: Universität des Saarlandes (1036) – fundername: Open Project of Xiangjiang Laboratory grantid: 22XJ02002; 22XJ03005 |
| GroupedDBID | -59 -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 23N 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6J9 6NX 6TJ 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFO ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BDATZ BGNMA BSONS C6C CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IXE IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM OVD P2P P9O PF0 PT4 PT5 QOS R89 R9I RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S27 S3B SAP SCO SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 YLTOR Z45 Z7R Z7X Z81 Z83 Z88 ZMTXR AAPKM AAYXX ABBRH ABDBE ABFSG ABJCF ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP ARAPS ATHPR AYFIA BENPR BGLVJ CCPQU CITATION HCIFZ K7- M7S PHGZM PHGZT PQGLB PTHSS 8FE 8FG AZQEC DWQXO GNUQQ JQ2 L6V P62 PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c363t-a85f31d2271601a6b6c55e2bd8884a08321281061970161cd24005c05d49cd8c3 |
| IEDL.DBID | M7S |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001018421400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1387-2532 |
| IngestDate | Sat Sep 27 04:20:27 EDT 2025 Sat Nov 29 01:33:09 EST 2025 Tue Nov 18 22:33:13 EST 2025 Fri Feb 21 02:40:52 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | W-hard Proportional approval voting Multiwinner voting Chamberlin–Courant’s approval voting Minimax approval voting Fixed-parameter tractability Treewidth |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c363t-a85f31d2271601a6b6c55e2bd8884a08321281061970161cd24005c05d49cd8c3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-7731-6818 |
| OpenAccessLink | https://link.springer.com/10.1007/s10458-023-09610-z |
| PQID | 3254230680 |
| PQPubID | 2043870 |
| ParticipantIDs | proquest_journals_3254230680 crossref_citationtrail_10_1007_s10458_023_09610_z crossref_primary_10_1007_s10458_023_09610_z springer_journals_10_1007_s10458_023_09610_z |
| PublicationCentury | 2000 |
| PublicationDate | 20231200 |
| PublicationDateYYYYMMDD | 2023-12-01 |
| PublicationDate_xml | – month: 12 year: 2023 text: 20231200 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Autonomous agents and multi-agent systems |
| PublicationTitleAbbrev | Auton Agent Multi-Agent Syst |
| PublicationYear | 2023 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Thiele, T. N. (1895). Om Flerfoldsvalg. In: Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger (pp. 415–441). BramsSJKilgourDMSanverMRA minimax procedure for electing committeesPublic Choice20071323–4401420 YangYGuoJThe control complexity of r\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r$$\end{document}-approval: From the single-peaked case to the general caseJournal of Computer and System Sciences2017894324493681252 LeGrand, R. (2004). Analysis of the minimax procedure. Techical Report, Department of Computer Science and Engineering, Washington University, St. Louis, USA SkowronPYuLFaliszewskiPElkindEThe complexity of fully proportional representation for single-crossing electoratesTheoretical Computer Science201556943573299789 LacknerMSkowronPConsistent approval-based multi-winner rulesJournal of Economic Theory20211924202182 ElkindEFaliszewskiPSkowronPSlinkoAProperties of multiwinner voting rulesSocial Choice and Welfare20174835996323620814 Elkind, E., & Lackner, M. (2015). Structure in dichotomous preferences. In IJCAI (pp. 2019–2025). DomMLokshtanovDSaurabhSKernelization lower bounds through colors and IDsACM Transactions on Algorithms2014112133283568 Bodlaender, H. L. (2012). Fixed-parameter tractability of treewidth and pathwidth. In The Multivariate Algorithmic Revolution and Beyond (pp. 196–227). CyganMFominFVKowalikLLokshtanovDMarxDPilipczukMPilipczukMSaurabhSParameterized algorithms2015Springer Brandstädt, A., Le, V. B., & Spinrad, J. P. (1999). Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia. Clearwater, A., Puppe, C., & Slinko, A. (2015). Generalizing the single-crossing property on lines and trees to intermediate preferences on median graphs. In IJCAI (pp. 32–38). FaliszewskiPSkowronPSlinkoATalmonNMultiwinner analogues of the plurality rule: Axiomatic and algorithmic perspectivesSocial Choice and Welfare20185135135503856879 WestDBIntroduction to graph theory2000Prentice-Hall EndrissUTrends in computational social choice2017AI Access BetzlerNSlinkoAUhlmannJOn the computation of fully proportional representationJournal of Artificial Intelligence Research2013474755193090736 Sui, X., Francois-Nienaber, A., & Boutilier, C. (2013). Multi-dimensional single-peaked consistency and its approximations. In IJCAI (pp. 375–382). Lin, A.P. (2011). The complexity of manipulating k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-approval elections. In ICAART (Vol. 2, pp. 212–218). arXiv:1005.4159. BredereckRFaliszewskiPKaczmarczykANiedermeierRSkowronPTalmonNRobustness among multiwinner voting rulesArtificial Intelligence20212901034034173242 LovászLPlummerMDMatching theory1986Elsevier CyganMKowalikLSocalaASornatKApproximation and parameterized complexity of minimax approval votingJournal of Artificial Intelligence Research2018634955133899746 Yu, L., Chan, H., & Elkind, E. (2013). Multiwinner elections under preferences that are single-peaked on a tree. In IJCAI (pp. 425–431). Yang, Y. (2020). On the complexity of destructive bribery in approval-based multi-winner voting. In AAMAS (pp. 1584–1592). YamaguchiAAokiKFMamitsukaHGraph complexity of chemical compounds in biological pathwaysGenome Informatics200314376377 Agrawal, A., Choudhary, P., Jain, P., Kanesh, L., Sahlot, V., & Saurabh, S. (2018). Hitting and covering partially. In COCOON (pp. 751–763). KrausePKLarischLSalfelderFThe tree-width of CDiscrete Applied Mathematics20202781361524087196 BodlaenderHLDrangePGDregiMSFominFVLokshtanovDPilipczukMA ckn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c^k n$$\end{document} 5-approximation algorithm for treewidthSIAM Journal on Computing20164523173783479705 Faliszewski, P., Skowron, P., & Talmon, N. (2017). Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules. In AAMAS (pp. 6–14). Peters, D., & Elkind, E. (2016). Preferences single-peaked on nice trees. In AAAI (pp. 594–600). Misra, N., Nabeel, A., & Singh, H. (2015). On the parameterized complexity of minimax approval voting. In: AAMAS (pp. 97–105). KilgourDMLaslierJ-FSanverMRApproval balloting for multi-winner electionsHandbook on Approval Voting2010Springer105124 CaiLParameterized complexity of cardinality constrained optimization problemsThe Computer Journal2008511102121 Yang, Y. (2021). A model of winners allocation. In: AAAI (pp. 5760–5767). Byrka, J., & Sornat, K. (2014). PTAS for minimax approval voting. In WINE (pp. 203–217). ChamberlinJRCourantPNRepresentative deliberations and representative decisions: Proportional representation and the Borda ruleAmerican Political Science Review1983773718733 Gupta, S., Jain, P., Saurabh, S., & Talmon, N. (2021). Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules. In IJCAI (pp. 217–223). Gawron, G., & Faliszewski. P. (2022). Using multiwinner voting to search for movies. In EUMAS (pp. 134–151). Yang, Y. (2019). On the tree representations of dichotomous preferences. In IJCAI (pp. 644–650). Ghosh, S., Mundhe, M., Hernandez, K., & Sen, S. (1999). Voting for movies: The anatomy of a recommender system. In AGENTS (pp. 434–435). ProcacciaADRosenscheinJSZoharAOn the complexity of achieving proportional representationSocial Choice and Welfare20083033533622377346 KilgourDMMarshallEFelsenthalDSMachoverMApproval balloting for fixed-size committeesElectoral systems-paradoxes, assumptions, and procedures2012Springer305326 Procaccia, A.D., Rosenschein, J.S., & Zohar, A. (2007). Multi-winner elections: Complexity of manipulation, control and winner-determination. In IJCAI (pp. 1476–1481). Kloks, T. (eds.) (1994). Treewidth: Computations and approximations. Lecture Notes in Computer Science, vol. 842. Springer. ThorupMAll structured programs have small tree-width and good register allocationInformation and Computation199814221591811613875 BläserMComputing small partial coveringsInformation Processing Letters20038563273311956935 LacknerMSkowronPMulti-winner voting with approval preferences2023Springer Yang, Y., & Wang, J. (2018). Parameterized complexity of multi-winner determination: More effort towards fixed-parameter tractability. In AAMAS (pp. 2142–2144). SkowronPFPT approximation schemes for maximizing submodular functionsInformation and Computation201725765783723701 Maniu, S., Senellart, P., & Jog, S. (2019). An experimental study of the treewidth of real-world graph data. In ICDT (p. 12). Bodlaender, H. L., & Kloks, T. (1991). Better algorithms for the pathwidth and treewidth of graphs. In ICALP (pp. 544–555). PetersDLacknerMPreferences single-peaked on a circleJournal of Artificial Intelligence Research2020684635024123622 SkowronPFaliszewskiPChamberlin-Courant rule with approval ballots: Approximating the maxcover problem with bounded frequencies in FPT timeJournal of Artificial Intelligence Research2017606877163732763 AzizHBrillMConitzerVElkindEFreemanRWalshTJustified representation in approval-based committee votingSocial Choice and Welfare20174824614853611519 Elkind, E., & Lackner, M. (2014). On detecting nearly structured preference profiles. In AAAI (pp. 661–667). Downey, R. G., & Fellows, M. R. (1992). Fixed parameter tractability and completeness. In Complexity Theory: Current Research (pp. 191–225). MarchandBPontyYBulteauLTree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformaticsAlgorithms for Molecular Biology20221718 Guo, J., Niedermeier, R., & Wernicke, S. (2005). Parameterized complexity of generalized vertex cover problems. In WADS (pp. 36–48). BodlaenderHLA tourist guide through treewidthActa Cybernetica1993111–21211268488 GareyMRJohnsonDSStockmeyerLSome simplified NP-complete graph problemsTheoretical Computer Science197613237267411240 Peters, D. (2018). Single-peakedness and total unimodularity: New polynomial-time algorithms for multi-winner elections. In AAAI (pp. 1169–1176). Downey, R. G., & Fellows, M. R. (2013). Fundamentals of parameterized complexity. Texts in computer science. Springer. Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., & Walsh, T. (2015). Computational aspects of multi-winner approval voting. In AAMAS (pp. 107–115). CourcelleBMosbahMMonadic second-order evaluations on tree-decomposable graphsTheoretical Computer Science19931091–249821205621 SkowronPFaliszewskiPLangJFinding a collective set of items: From proportional multirepresentation to group recommendationArtificial Intelligence20162411912163558243 SchrijverATheory of linear and integer programming1986Wiley LenstraHWInteger programming with a fixed number of variablesMathematics of Operations Research198384538548727410 Boehmer, N., & Schaar, N. (2023). Collecting, classifying, analyzing, and using real-world ranking data. In AAMAS (pp. 1706–1715). Cornaz, D., Galand, L., & Spanjaard, O. (2012). Bounded single-peaked width and proportional representation. In ECAI (pp. 270–275). FominFVLiedloffMMontealegrePTodincaIAlgorithms parameterized by vertex cover and modular width, through potential maximal cliquesAlgorithmica2018804114611693769285 Liu, H., & Guo, J. (2016). Parameterized complexity of winner determination in minimax committee elections. In AAMAS (pp. 341–349). RobertsonNSeymourPDGraph minors. II. Algorithmic aspects of tree-widthJournal of algorithms198673309322855559 FaliszewskiPSlinkoAStahlKTalmonNAchieving fully proportional representation by clustering votersJournal of Heuristics2018245725756 Fer 9610_CR42 9610_CR45 H Aziz (9610_CR2) 2017; 48 RG Downey (9610_CR26) 1995; 141 PK Krause (9610_CR47) 2020; 278 AD Procaccia (9610_CR61) 2008; 30 L Cai (9610_CR17) 2008; 51 DM Kilgour (9610_CR43) 2010 P Skowron (9610_CR65) 2017; 257 E Elkind (9610_CR28) 2017; 48 SJ Brams (9610_CR11) 2007; 132 R Bredereck (9610_CR15) 2020; 814 9610_CR80 M Dom (9610_CR24) 2014; 11 M Lackner (9610_CR48) 2023 9610_CR81 M Cygan (9610_CR22) 2015 9610_CR40 9610_CR41 9610_CR53 9610_CR10 B Courcelle (9610_CR21) 1993; 109 9610_CR55 9610_CR12 A Yamaguchi (9610_CR74) 2003; 14 9610_CR13 9610_CR57 9610_CR58 9610_CR59 9610_CR16 B Marchand (9610_CR56) 2022; 17 DB West (9610_CR73) 2000 9610_CR19 P Faliszewski (9610_CR35) 2018; 24 M Thorup (9610_CR71) 1998; 142 P Faliszewski (9610_CR32) 2018; 51 FV Fomin (9610_CR37) 2018; 80 HW Lenstra (9610_CR51) 1983; 8 L Lovász (9610_CR54) 1986 P Skowron (9610_CR67) 2016; 241 Y Yang (9610_CR79) 2017; 89 M Cygan (9610_CR23) 2018; 63 A Schrijver (9610_CR64) 1986 H Fernau (9610_CR36) 2014; 19 9610_CR50 9610_CR52 9610_CR3 9610_CR20 R Bredereck (9610_CR14) 2021; 290 N Robertson (9610_CR63) 1986; 7 JR Chamberlin (9610_CR18) 1983; 77 9610_CR6 9610_CR25 9610_CR69 9610_CR9 9610_CR27 9610_CR29 P Skowron (9610_CR66) 2017; 60 HL Bodlaender (9610_CR8) 2016; 45 N Betzler (9610_CR4) 2013; 47 M Bläser (9610_CR5) 2003; 85 (9610_CR31) 2017 MR Garey (9610_CR38) 1976; 1 9610_CR62 T Kloks (9610_CR46) 1995; 19 M Lackner (9610_CR49) 2021; 192 P Skowron (9610_CR68) 2015; 569 9610_CR75 9610_CR76 9610_CR33 9610_CR77 9610_CR34 9610_CR78 HL Bodlaender (9610_CR7) 1993; 11 9610_CR39 DM Kilgour (9610_CR44) 2012 9610_CR70 9610_CR72 9610_CR1 9610_CR30 D Peters (9610_CR60) 2020; 68 |
| References_xml | – reference: Sui, X., Francois-Nienaber, A., & Boutilier, C. (2013). Multi-dimensional single-peaked consistency and its approximations. In IJCAI (pp. 375–382). – reference: Clearwater, A., Puppe, C., & Slinko, A. (2015). Generalizing the single-crossing property on lines and trees to intermediate preferences on median graphs. In IJCAI (pp. 32–38). – reference: Liu, H., & Guo, J. (2016). Parameterized complexity of winner determination in minimax committee elections. In AAMAS (pp. 341–349). – reference: ChamberlinJRCourantPNRepresentative deliberations and representative decisions: Proportional representation and the Borda ruleAmerican Political Science Review1983773718733 – reference: SchrijverATheory of linear and integer programming1986Wiley – reference: PetersDLacknerMPreferences single-peaked on a circleJournal of Artificial Intelligence Research2020684635024123622 – reference: KilgourDMLaslierJ-FSanverMRApproval balloting for multi-winner electionsHandbook on Approval Voting2010Springer105124 – reference: LenstraHWInteger programming with a fixed number of variablesMathematics of Operations Research198384538548727410 – reference: CourcelleBMosbahMMonadic second-order evaluations on tree-decomposable graphsTheoretical Computer Science19931091–249821205621 – reference: BredereckRFaliszewskiPNiedermeierRSkowronPTalmonNMixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and votingTheoretical Computer Science2020814861054074730 – reference: FaliszewskiPSlinkoAStahlKTalmonNAchieving fully proportional representation by clustering votersJournal of Heuristics2018245725756 – reference: Ghosh, S., Mundhe, M., Hernandez, K., & Sen, S. (1999). Voting for movies: The anatomy of a recommender system. In AGENTS (pp. 434–435). – reference: KrausePKLarischLSalfelderFThe tree-width of CDiscrete Applied Mathematics20202781361524087196 – reference: Yang, Y. (2021). A model of winners allocation. In: AAAI (pp. 5760–5767). – reference: Byrka, J., & Sornat, K. (2014). PTAS for minimax approval voting. In WINE (pp. 203–217). – reference: Yang, Y. (2019). Complexity of manipulating and controlling approval-based multiwinner voting. In IJCAI (pp. 637–643). – reference: Faliszewski, P., Skowron, P., & Talmon, N. (2017). Bribery as a measure of candidate success: Complexity results for approval-based multiwinner rules. In AAMAS (pp. 6–14). – reference: BramsSJKilgourDMSanverMRA minimax procedure for electing committeesPublic Choice20071323–4401420 – reference: GareyMRJohnsonDSStockmeyerLSome simplified NP-complete graph problemsTheoretical Computer Science197613237267411240 – reference: KilgourDMMarshallEFelsenthalDSMachoverMApproval balloting for fixed-size committeesElectoral systems-paradoxes, assumptions, and procedures2012Springer305326 – reference: BodlaenderHLA tourist guide through treewidthActa Cybernetica1993111–21211268488 – reference: Downey, R. G., & Fellows, M. R. (1992). Fixed parameter tractability and completeness. In Complexity Theory: Current Research (pp. 191–225). – reference: Kloks, T. (eds.) (1994). Treewidth: Computations and approximations. Lecture Notes in Computer Science, vol. 842. Springer. – reference: Lin, A.P. (2011). The complexity of manipulating k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-approval elections. In ICAART (Vol. 2, pp. 212–218). arXiv:1005.4159. – reference: BetzlerNSlinkoAUhlmannJOn the computation of fully proportional representationJournal of Artificial Intelligence Research2013474755193090736 – reference: LeGrand, R. (2004). Analysis of the minimax procedure. Techical Report, Department of Computer Science and Engineering, Washington University, St. Louis, USA – reference: Elkind, E., & Lackner, M. (2014). On detecting nearly structured preference profiles. In AAAI (pp. 661–667). – reference: Yang, Y., & Wang, J. (2018). Parameterized complexity of multi-winner determination: More effort towards fixed-parameter tractability. In AAMAS (pp. 2142–2144). – reference: Brandstädt, A., Le, V. B., & Spinrad, J. P. (1999). Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia. – reference: Yang, Y. (2019). On the tree representations of dichotomous preferences. In IJCAI (pp. 644–650). – reference: MarchandBPontyYBulteauLTree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformaticsAlgorithms for Molecular Biology20221718 – reference: Peters, D., & Elkind, E. (2016). Preferences single-peaked on nice trees. In AAAI (pp. 594–600). – reference: ProcacciaADRosenscheinJSZoharAOn the complexity of achieving proportional representationSocial Choice and Welfare20083033533622377346 – reference: Downey, R. G., & Fellows, M. R. (2013). Fundamentals of parameterized complexity. Texts in computer science. Springer. – reference: Procaccia, A.D., Rosenschein, J.S., & Zohar, A. (2007). Multi-winner elections: Complexity of manipulation, control and winner-determination. In IJCAI (pp. 1476–1481). – reference: Yang, Y. (2020). On the complexity of destructive bribery in approval-based multi-winner voting. In AAMAS (pp. 1584–1592). – reference: Guo, J., Niedermeier, R., & Wernicke, S. (2005). Parameterized complexity of generalized vertex cover problems. In WADS (pp. 36–48). – reference: CyganMFominFVKowalikLLokshtanovDMarxDPilipczukMPilipczukMSaurabhSParameterized algorithms2015Springer – reference: Yu, L., Chan, H., & Elkind, E. (2013). Multiwinner elections under preferences that are single-peaked on a tree. In IJCAI (pp. 425–431). – reference: Gawron, G., & Faliszewski. P. (2022). Using multiwinner voting to search for movies. In EUMAS (pp. 134–151). – reference: KloksTKratschDTreewidth of chordal bipartite graphsJournal of Algorithms19951922662811344547 – reference: SkowronPFaliszewskiPChamberlin-Courant rule with approval ballots: Approximating the maxcover problem with bounded frequencies in FPT timeJournal of Artificial Intelligence Research2017606877163732763 – reference: Bodlaender, H. L., & Kloks, T. (1991). Better algorithms for the pathwidth and treewidth of graphs. In ICALP (pp. 544–555). – reference: YamaguchiAAokiKFMamitsukaHGraph complexity of chemical compounds in biological pathwaysGenome Informatics200314376377 – reference: FernauHFominFVLokshtanovDMnichMPhilipGSaurabhSSocial choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problemsTsinghua Science and Technology20141943743863260440 – reference: FominFVLiedloffMMontealegrePTodincaIAlgorithms parameterized by vertex cover and modular width, through potential maximal cliquesAlgorithmica2018804114611693769285 – reference: Misra, N., Nabeel, A., & Singh, H. (2015). On the parameterized complexity of minimax approval voting. In: AAMAS (pp. 97–105). – reference: SkowronPFaliszewskiPLangJFinding a collective set of items: From proportional multirepresentation to group recommendationArtificial Intelligence20162411912163558243 – reference: LacknerMSkowronPConsistent approval-based multi-winner rulesJournal of Economic Theory20211924202182 – reference: Agrawal, A., Choudhary, P., Jain, P., Kanesh, L., Sahlot, V., & Saurabh, S. (2018). Hitting and covering partially. In COCOON (pp. 751–763). – reference: Cornaz, D., Galand, L., & Spanjaard, O. (2012). Bounded single-peaked width and proportional representation. In ECAI (pp. 270–275). – reference: SkowronPYuLFaliszewskiPElkindEThe complexity of fully proportional representation for single-crossing electoratesTheoretical Computer Science201556943573299789 – reference: LacknerMSkowronPMulti-winner voting with approval preferences2023Springer – reference: SkowronPFPT approximation schemes for maximizing submodular functionsInformation and Computation201725765783723701 – reference: van der Zanden, T. C. (2019). Theory and practical applications of treewidth. Ph.D. thesis, Utrecht University, Netherlands. – reference: CyganMKowalikLSocalaASornatKApproximation and parameterized complexity of minimax approval votingJournal of Artificial Intelligence Research2018634955133899746 – reference: RobertsonNSeymourPDGraph minors. II. Algorithmic aspects of tree-widthJournal of algorithms198673309322855559 – reference: CaiLParameterized complexity of cardinality constrained optimization problemsThe Computer Journal2008511102121 – reference: Aziz, H., Gaspers, S., Gudmundsson, J., Mackenzie, S., Mattei, N., & Walsh, T. (2015). Computational aspects of multi-winner approval voting. In AAMAS (pp. 107–115). – reference: LovászLPlummerMDMatching theory1986Elsevier – reference: ThorupMAll structured programs have small tree-width and good register allocationInformation and Computation199814221591811613875 – reference: Elkind, E., & Lackner, M. (2015). Structure in dichotomous preferences. In IJCAI (pp. 2019–2025). – reference: Peters, D. (2018). Single-peakedness and total unimodularity: New polynomial-time algorithms for multi-winner elections. In AAAI (pp. 1169–1176). – reference: BläserMComputing small partial coveringsInformation Processing Letters20038563273311956935 – reference: Bodlaender, H. L. (2012). Fixed-parameter tractability of treewidth and pathwidth. In The Multivariate Algorithmic Revolution and Beyond (pp. 196–227). – reference: FaliszewskiPSkowronPSlinkoATalmonNMultiwinner analogues of the plurality rule: Axiomatic and algorithmic perspectivesSocial Choice and Welfare20185135135503856879 – reference: Faliszewski, P., Skowron, P., Slinko, A., & Talmon, N. (2016). Committee scoring rules: Axiomatic classification and hierarchy. In IJCAI (pp. 250–256). – reference: DomMLokshtanovDSaurabhSKernelization lower bounds through colors and IDsACM Transactions on Algorithms2014112133283568 – reference: WestDBIntroduction to graph theory2000Prentice-Hall – reference: Maniu, S., Senellart, P., & Jog, S. (2019). An experimental study of the treewidth of real-world graph data. In ICDT (p. 12). – reference: EndrissUTrends in computational social choice2017AI Access – reference: BodlaenderHLDrangePGDregiMSFominFVLokshtanovDPilipczukMA ckn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c^k n$$\end{document} 5-approximation algorithm for treewidthSIAM Journal on Computing20164523173783479705 – reference: Bredereck, R., Faliszewski, P., Kaczmarczyk, A., Knop, D., & Niedermeier, R. (2021). Parameterized algorithms for finding a collective set of items. In AAAI (pp. 1838–1845). – reference: BredereckRFaliszewskiPKaczmarczykANiedermeierRSkowronPTalmonNRobustness among multiwinner voting rulesArtificial Intelligence20212901034034173242 – reference: YangYGuoJThe control complexity of r\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r$$\end{document}-approval: From the single-peaked case to the general caseJournal of Computer and System Sciences2017894324493681252 – reference: Boehmer, N., & Schaar, N. (2023). Collecting, classifying, analyzing, and using real-world ranking data. In AAMAS (pp. 1706–1715). – reference: Gupta, S., Jain, P., Saurabh, S., & Talmon, N. (2021). Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules. In IJCAI (pp. 217–223). – reference: DowneyRGFellowsMRFixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science19951411–21091311323150 – reference: Thiele, T. N. (1895). Om Flerfoldsvalg. In: Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger (pp. 415–441). – reference: AzizHBrillMConitzerVElkindEFreemanRWalshTJustified representation in approval-based committee votingSocial Choice and Welfare20174824614853611519 – reference: ElkindEFaliszewskiPSkowronPSlinkoAProperties of multiwinner voting rulesSocial Choice and Welfare20174835996323620814 – volume: 241 start-page: 191 year: 2016 ident: 9610_CR67 publication-title: Artificial Intelligence doi: 10.1016/j.artint.2016.09.003 – volume: 8 start-page: 538 issue: 4 year: 1983 ident: 9610_CR51 publication-title: Mathematics of Operations Research doi: 10.1287/moor.8.4.538 – volume-title: Multi-winner voting with approval preferences year: 2023 ident: 9610_CR48 doi: 10.1007/978-3-031-09016-5 – ident: 9610_CR69 – volume: 278 start-page: 136 year: 2020 ident: 9610_CR47 publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2019.01.027 – ident: 9610_CR52 – ident: 9610_CR81 – ident: 9610_CR42 doi: 10.24963/ijcai.2021/31 – volume: 109 start-page: 49 issue: 1–2 year: 1993 ident: 9610_CR21 publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(93)90064-Z – volume: 17 start-page: 8 issue: 1 year: 2022 ident: 9610_CR56 publication-title: Algorithms for Molecular Biology doi: 10.1186/s13015-022-00213-z – ident: 9610_CR6 doi: 10.1007/978-3-642-30891-8_12 – ident: 9610_CR33 – start-page: 305 volume-title: Electoral systems-paradoxes, assumptions, and procedures year: 2012 ident: 9610_CR44 doi: 10.1007/978-3-642-20441-8_12 – ident: 9610_CR75 doi: 10.1609/aaai.v35i6.16722 – volume: 30 start-page: 353 issue: 3 year: 2008 ident: 9610_CR61 publication-title: Social Choice and Welfare doi: 10.1007/s00355-007-0235-2 – volume: 45 start-page: 317 issue: 2 year: 2016 ident: 9610_CR8 publication-title: SIAM Journal on Computing doi: 10.1137/130947374 – ident: 9610_CR16 doi: 10.1007/978-3-319-13129-0_15 – volume: 132 start-page: 401 issue: 3–4 year: 2007 ident: 9610_CR11 publication-title: Public Choice doi: 10.1007/s11127-007-9165-x – volume: 63 start-page: 495 year: 2018 ident: 9610_CR23 publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.1.11253 – volume: 290 start-page: 103403 year: 2021 ident: 9610_CR14 publication-title: Artificial Intelligence doi: 10.1016/j.artint.2020.103403 – ident: 9610_CR10 – ident: 9610_CR40 doi: 10.1145/301136.301303 – volume: 11 start-page: 1 issue: 1–2 year: 1993 ident: 9610_CR7 publication-title: Acta Cybernetica – start-page: 105 volume-title: Handbook on Approval Voting year: 2010 ident: 9610_CR43 doi: 10.1007/978-3-642-02839-7_6 – volume: 85 start-page: 327 issue: 6 year: 2003 ident: 9610_CR5 publication-title: Information Processing Letters doi: 10.1016/S0020-0190(02)00434-9 – ident: 9610_CR53 – ident: 9610_CR29 – ident: 9610_CR41 doi: 10.1007/11534273_5 – ident: 9610_CR77 doi: 10.24963/ijcai.2019/90 – ident: 9610_CR80 – volume: 1 start-page: 237 issue: 3 year: 1976 ident: 9610_CR38 publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(76)90059-1 – ident: 9610_CR57 – ident: 9610_CR70 – ident: 9610_CR9 doi: 10.1007/3-540-54233-7_162 – volume: 68 start-page: 463 year: 2020 ident: 9610_CR60 publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.1.11732 – ident: 9610_CR1 doi: 10.1007/978-3-319-94776-1_62 – ident: 9610_CR19 – ident: 9610_CR39 doi: 10.1007/978-3-031-20614-6_8 – ident: 9610_CR45 doi: 10.1007/BFb0045375 – ident: 9610_CR3 – volume: 47 start-page: 475 year: 2013 ident: 9610_CR4 publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.3896 – volume: 142 start-page: 159 issue: 2 year: 1998 ident: 9610_CR71 publication-title: Information and Computation doi: 10.1006/inco.1997.2697 – ident: 9610_CR30 doi: 10.1609/aaai.v28i1.8823 – volume: 7 start-page: 309 issue: 3 year: 1986 ident: 9610_CR63 publication-title: Journal of algorithms doi: 10.1016/0196-6774(86)90023-4 – ident: 9610_CR58 doi: 10.1609/aaai.v32i1.11460 – volume: 60 start-page: 687 year: 2017 ident: 9610_CR66 publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.5628 – ident: 9610_CR59 doi: 10.1609/aaai.v30i1.10049 – volume: 89 start-page: 432 year: 2017 ident: 9610_CR79 publication-title: Journal of Computer and System Sciences doi: 10.1016/j.jcss.2017.06.004 – volume: 51 start-page: 513 issue: 3 year: 2018 ident: 9610_CR32 publication-title: Social Choice and Welfare doi: 10.1007/s00355-018-1126-4 – volume-title: Matching theory year: 1986 ident: 9610_CR54 – ident: 9610_CR12 doi: 10.1137/1.9780898719796 – volume: 814 start-page: 86 year: 2020 ident: 9610_CR15 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2020.01.017 – ident: 9610_CR50 – volume: 19 start-page: 266 issue: 2 year: 1995 ident: 9610_CR46 publication-title: Journal of Algorithms doi: 10.1006/jagm.1995.1037 – volume-title: Trends in computational social choice year: 2017 ident: 9610_CR31 – volume: 24 start-page: 725 issue: 5 year: 2018 ident: 9610_CR35 publication-title: Journal of Heuristics doi: 10.1007/s10732-018-9376-y – ident: 9610_CR62 – ident: 9610_CR20 – volume: 51 start-page: 102 issue: 1 year: 2008 ident: 9610_CR17 publication-title: The Computer Journal doi: 10.1093/comjnl/bxm086 – volume: 80 start-page: 1146 issue: 4 year: 2018 ident: 9610_CR37 publication-title: Algorithmica doi: 10.1007/s00453-017-0297-1 – volume-title: Introduction to graph theory year: 2000 ident: 9610_CR73 – ident: 9610_CR13 doi: 10.1609/aaai.v34i02.5551 – volume: 48 start-page: 599 issue: 3 year: 2017 ident: 9610_CR28 publication-title: Social Choice and Welfare doi: 10.1007/s00355-017-1026-z – volume: 48 start-page: 461 issue: 2 year: 2017 ident: 9610_CR2 publication-title: Social Choice and Welfare doi: 10.1007/s00355-016-1019-3 – volume: 141 start-page: 109 issue: 1–2 year: 1995 ident: 9610_CR26 publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(94)00097-3 – ident: 9610_CR27 – volume: 192 year: 2021 ident: 9610_CR49 publication-title: Journal of Economic Theory doi: 10.1016/j.jet.2020.105173 – ident: 9610_CR55 – volume: 569 start-page: 43 year: 2015 ident: 9610_CR68 publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2014.12.012 – ident: 9610_CR76 – ident: 9610_CR25 doi: 10.1007/978-1-4471-5559-1 – ident: 9610_CR72 – volume: 14 start-page: 376 year: 2003 ident: 9610_CR74 publication-title: Genome Informatics – volume: 11 start-page: 13 issue: 2 year: 2014 ident: 9610_CR24 publication-title: ACM Transactions on Algorithms – volume: 257 start-page: 65 year: 2017 ident: 9610_CR65 publication-title: Information and Computation doi: 10.1016/j.ic.2017.10.002 – ident: 9610_CR34 – volume-title: Theory of linear and integer programming year: 1986 ident: 9610_CR64 – ident: 9610_CR78 doi: 10.24963/ijcai.2019/91 – volume: 19 start-page: 374 issue: 4 year: 2014 ident: 9610_CR36 publication-title: Tsinghua Science and Technology doi: 10.1109/TST.2014.6867519 – volume-title: Parameterized algorithms year: 2015 ident: 9610_CR22 doi: 10.1007/978-3-319-21275-3 – volume: 77 start-page: 718 issue: 3 year: 1983 ident: 9610_CR18 publication-title: American Political Science Review doi: 10.2307/1957270 |
| SSID | ssj0016261 |
| Score | 2.3868728 |
| Snippet | We study the parameterized complexity of winner determination problems for three prevalent
k
-committee selection rules, namely the minimax approval voting... We study the parameterized complexity of winner determination problems for three prevalent k-committee selection rules, namely the minimax approval voting... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 28 |
| SubjectTerms | Algorithms Artificial Intelligence Candidates Committees Complexity Computer Science Computer Systems Organization and Communication Networks Decision making Elections Graphs Parameterization Parameters Software Engineering/Programming and Operating Systems User Interfaces and Human Computer Interaction Voters |
| SummonAdditionalLinks | – databaseName: Springer LINK dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7o9ODF-ROnU3LwpoE0bbfUm4jDg8jwx9ittEkqA9nGWnXurzcvbTYVFfTcNC3vJXnvke99H8BxmiVcI6JGRKmgQRYwGgmlqYwYl4E2h6Vl5-9dt29uRL8fdaumsNyh3d2VpD2pPzS7BaGgJsZQlClhdLYMKybcCRRsuL3rze8OTIpellkCOQh8XrXKfD_H53C0yDG_XIvaaNOp_-8_N2C9yi7JebkcNmFJD7eg7pQbSLWRt-GxmyAoC3maZ1oRiyvXU5OQk1FGLMbw1WpyEeXQMui_M4KoXKIzk-gWpLCA25xkg6lWdOwmJAX2XZXs32878NC5vL-4opXkApV-yy9oIsLM9xTnpoxiXtJKWzIMNU-VKZSDhKGsERdYRUZtzBWlQghqKFmogghZBvxdqA1HQ70HRHEhtInAqp15gVkqJhRKX8lWmnLzFaYa4DnLx7LiI0dZjKd4waSMloyNJWNryXjWgJP5O-OSjePX0U3n0LjamXnsm4oYyy7BGnDqHLh4_PNs-38bfgBrqExfIl-aUCsmz_oQVuVLMcgnR3bFvgPdlueC priority: 102 providerName: Springer Nature |
| Title | Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability |
| URI | https://link.springer.com/article/10.1007/s10458-023-09610-z https://www.proquest.com/docview/3254230680 |
| Volume | 37 |
| WOSCitedRecordID | wos001018421400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1573-7454 dateEnd: 20241212 omitProxy: false ssIdentifier: ssj0016261 issn: 1387-2532 databaseCode: K7- dateStart: 20230601 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1573-7454 dateEnd: 20241212 omitProxy: false ssIdentifier: ssj0016261 issn: 1387-2532 databaseCode: M7S dateStart: 20230601 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 1573-7454 dateEnd: 20241212 omitProxy: false ssIdentifier: ssj0016261 issn: 1387-2532 databaseCode: P5Z dateStart: 20230601 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-7454 dateEnd: 20241212 omitProxy: false ssIdentifier: ssj0016261 issn: 1387-2532 databaseCode: BENPR dateStart: 20230601 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-7454 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016261 issn: 1387-2532 databaseCode: RSV dateStart: 19980301 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7o9ODF-ROnc-TgTYNt2q6pF1GZCMoY_kK8lDZJZSDbXKvO_fXmpalDQS9eemmbFr4k773ky_cB7KVZwhQyaniUcupnvkMjLhUVkcOEr_RkadT576_Cbpc_PEQ9u-CWW1plNSeaiVoOBa6RH3q6ksF0mTvHoxeKrlG4u2otNOZhAVUSXEPdu_naRdDJellwcVQj8Jg9NGOPzvkBpzpiUTQ9cej0e2CaZZs_NkhN3Dmv__ePV2DZZpzkpOwiqzCnBmtQr9wciB3c6_DUS5CohdrNUyWJ4ZqriU7SyTAjhnf4bny6iKwYNIjpEUGmLlGZTn4LUhgSbk6y_kRJOqoaJAWexSoVwT824O68c3t2Qa0NAxVe2ytowoPMcyVjurRy3KSdtkUQKJZKXTz7iYNWR4xjZRmFmD8KibTUQDiB9CNUHvA2oTYYDtQWEMk4VzoqyzBzfd19dHgUnhTtNGX6K45sgFthEAurUY5WGc_xTF0ZcYs1brHBLZ42YP_rnVGp0PHn080KrNiO1jyeIdWAgwru2e3fW9v-u7UdWEJ3-pL90oRaMX5Vu7Ao3op-Pm7Bwmmn27tuwfxlSFum5-prL3jU1-ub-08znPUo |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB60CnrxLVar7kFPuphukmYjiIgPlNbiQcVbTHY3UpC2tvHR_ih_ozubrEVBbx48J5mQ5JvZ-bLfzABsJWnMFCpqeJhw6qWeQ0MuFRWhw4SndLA03flvG0Gzye_uwqsxeLe1MCirtDHRBGrZEfiPfM_VTAbTZe4cdp8oTo3C3VU7QiOHRV0NXjVl6x9cnOjvu83Y2en18TktpgpQ4dbcjMbcT92qZEwzBaca15Ka8H3FEqm5oBc7OLmHcSRKYYDpkJCosvSF40svxEJ6V9sdhwnP5QH6VT2gn7sWmhzkBI9j9wOXFUU6Rame53OqV0iKQ1YcOvy6EI6y228bsmadO5v9b29oDmaKjJoc5S4wD2OqvQCzdloFKYLXIjxcxShEw97UQyWJ0dKrN01CSCclRlf5auaQEWkVQojZfYJKZKJSndxnJDMi4z5JW29K0q41SDKsNcs7ng-W4OZPHncZSu1OW60AkYxzpbMOGaRVT7uHXv6FK0UtSZi-iyPLULXfPBJFD3YcBfIYjbpHI04ijZPI4CQalmHn85pu3oHk17MrFhxREY360QgZZdi18Bod_tna6u_WNmHq_PqyETUumvU1mGaIbqP0qUAp6z2rdZgUL1mr39swfkLg_q9h9wHop0jI |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1dS8MwFL3oFPHF-YnTqXnwTYNt2m6pb6IOxTEG6thbaZNUBtKNrercrzc3bbcpKojPbdOSm_TeQ849B-A4ikOmkFHD_YhTN3Yt6nOpqPAtJlylf5ZGnb_TrLdavNv123Nd_IbtXhxJZj0NqNKUpGcDGZ_NNb65Hqc631C0LLHoZBGWXCTSI16_70zPEXS5nkEujnoEDsvbZr4f43NqmtWbX45ITeZplP__zeuwlled5CJbJhuwoJJNKBeODiTf4Fvw1A6RrIX6zRMlieGbq7Eu1Ek_JoZ7-Ga8uogsWDQY13OCbF2iYl0ApyQ1RNwRiXtjJemgGJCk2I-VqYK_b8Nj4_rh8obmVgxUODUnpSH3YseWjGl4ZdlhLaoJz1MskhpAu6GFdkeMI7r061hDConUVE9YnnR9VB9wdqCU9BO1C0QyzpXOzLIe265eQjpFCkeKWhQx_RZLVsAuohCIXKcc7TKeg5nCMs5koGcyMDMZTCpwMn1mkKl0_Hp3tQhukO_YUeBopIxwjFsVOC2CObv882h7f7v9CFbaV42gedu624dVNK_PyDFVKKXDF3UAy-I17Y2Gh2YhfwD3e_NK |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parameterized+complexity+of+multiwinner+determination%3A+more+effort+towards+fixed-parameter+tractability&rft.jtitle=Autonomous+agents+and+multi-agent+systems&rft.au=Yang%2C+Yongjie&rft.au=Wang%2C+Jianxin&rft.date=2023-12-01&rft.pub=Springer+Nature+B.V&rft.issn=1387-2532&rft.eissn=1573-7454&rft.volume=37&rft.issue=2&rft.spage=28&rft_id=info:doi/10.1007%2Fs10458-023-09610-z |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1387-2532&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1387-2532&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1387-2532&client=summon |