Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability (2107.04685v5)

Published 9 Jul 2021 in cs.GT and cs.MA

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (81)
  1. In: COCOON, pp. 751–763 (2018)
  2. Soc. Choice Welfare 48(2), 461–485 (2017)
  3. In: AAMAS, pp. 107–115 (2015)
  4. J. Artif. Intell. Res. 47, 475–519 (2013)
  5. Bläser, M.: Computing small partial coverings. Inf. Process. Lett. 85(6), 327–331 (2003)
  6. Bodlaender, H.L.: Fixed-parameter tractability of treewidth and pathwidth. In: The Multivariate Algorithmic Revolution and Beyond, pp. 196–227 (2012)
  7. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1-2), 1–21 (1993)
  8. SIAM J. Comput. 45(2), 317–378 (2016)
  9. In: ICALP, pp. 544–555 (1991)
  10. In: AAMAS. pp. 1706–1715 (2023)
  11. Public Choice 132(3-4), 401–420 (2007)
  12. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, USA (1999).
  13. In: AAAI. pp. 1838–1845 (2021)
  14. Artif. Intell. 290, Nr. 103403 (2021)
  15. Theor. Comput. Sci. 814, 86–105 (2020)
  16. In: WINE, pp. 203–217 (2014)
  17. Cai, L.: Parameterized complexity of cardinality constrained optimization problems. Comput. J. 51(1), 102–121 (2008)
  18. Am. Polit. Sci. Rev. 77(3), 718–733 (1983)
  19. In: IJCAI, pp. 32–38 (2015)
  20. In: ECAI, pp. 270–275 (2012)
  21. Theor. Comput. Sci. 109(1-2), 49–82 (1993)
  22. Springer (2015).
  23. J. Artif. Intell. Res. 63, 495–513 (2018)
  24. ACM Trans. Algorithms 11(2), Nr. 13 (2014)
  25. Texts in Computer Science. Springer (2013)
  26. Theor. Comput. Sci. 141(1-2), 109–131 (1995)
  27. In: Complexity Theory: Current Research, pp. 191–225 (1992)
  28. Soc. Choice Welfare 48(3), 599–632 (2017)
  29. In: IJCAI, pp. 2019–2025 (2015)
  30. In: AAAI, pp. 661–667 (2014)
  31. Endriss, U. (eds.): Trends in Computational Social Choice. AI Access (2017)
  32. Soc. Choice Welfare 51(3), 513–550 (2018)
  33. In: IJCAI, pp. 250–256 (2016)
  34. In: AAMAS, pp. 6–14 (2017)
  35. J. Heuristics 24(5), 725–756 (2018)
  36. Tsinghua Sci. Technol. 19(4), 374–386 (2014)
  37. Algorithmica 80(4), 1146–1169 (2018)
  38. Theor. Comput. Sci. 1(3), 237–267 (1976)
  39. In: EUMAS, pp. 134–151 (2022)
  40. In: AGENTS, pp. 434–435 (1999)
  41. In: WADS, pp. 36–48 (2005)
  42. In: IJCAI, pp. 217–223 (2021)
  43. Kilgour, D.M.: Approval balloting for multi-winner elections. In: Laslier, J.-F., Sanver, M.R. (eds.) Handbook on Approval Voting, pp. 105–124. Springer (2010).
  44. In: Felsenthal, D.S., Machover, M. (eds.) Electoral Systems—Paradoxes, Assumptions, and Procedures, pp. 305–326, Springer (2012).
  45. Springer (1994).
  46. J. Algorithms 19(2), 266–281 (1995)
  47. Discret. Appl. Math. 278, 136–152 (2020)
  48. Springer (2023)
  49. J. Econ. Theory 192, Nr. 105173 (2021)
  50. LeGrand, R.: Analysis of the minimax procedure. Techical Report, Department of Computer Science and Engineering, Washington University, St. Louis, USA (2004)
  51. Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538–548 (1983)
  52. Lin, A.P.: The complexity of manipulating k𝑘kitalic_k-approval elections. In: ICAART (2), pp. 212–218 (2011) URL http://arxiv.org/abs/1005.4159
  53. In: AAMAS, pp. 341–349 (2016)
  54. Elsevier, North Holland, Netherlands (1986)
  55. In: ICDT, Nr. 12 (2019)
  56. Algorithms Mol. Biol. 17(1), Nr. 8 (2022)
  57. In: AAMAS, pp. 97–105 (2015)
  58. Peters, D.: Single-peakedness and total unimodularity: New polynomial-time algorithms for multi-winner elections. In: AAAI, pp. 1169–1176 (2018)
  59. In: AAAI, pp. 594–600 (2016)
  60. J. Artif. Intell. Res. 68, 463–502 (2020)
  61. Soc. Choice Welfare 30(3), 353–362 (2008)
  62. In: IJCAI, pp. 1476–1481 (2007)
  63. J. Algorithms 7(3), 309–322 (1986)
  64. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Inc., New York, USA (1986)
  65. Skowron, P.: FPT approximation schemes for maximizing submodular functions. Inf. Comput. 257, 65–78 (2017)
  66. J. Artif. Intell. Res. 60, 687–716 (2017)
  67. Artif. Intell. 241, 191–216 (2016)
  68. Theor. Comput. Sci. 569, 43–57 (2015)
  69. In: IJCAI, pp. 375–382 (2013)
  70. Thiele, T.N.: Om Flerfoldsvalg. In: Oversigt over det Kongelige Danske Videnskabernes Selskabs Forhandlinger, pp. 415–441 (1895)
  71. Thorup, M.: All structured programs have small tree-width and good register allocation. Inf. Comput. 142(2), 159–181 (1998)
  72. van der Zanden, T.C.: Theory and practical applications of treewidth. Ph.D. thesis, Utrecht University, Netherlands (2019).
  73. West, D.B.: Introduction to Graph Theory. Prentice-Hall (2000)
  74. Genome Informatics 14, 376–377 (2003)
  75. Yang, Y.: A model of winners allocation. In: AAAI, pp. 5760–5767 (2021)
  76. Yang, Y.: On the complexity of destructive bribery in approval-based multi-winner voting. In: AAMAS, pp. 1584–1592 (2020)
  77. Yang, Y.: Complexity of manipulating and controlling approval-based multiwinner voting. In: IJCAI, pp. 637–643 (2019)
  78. Yang, Y.: On the tree representations of dichotomous preferences. In: IJCAI, pp. 644–650 (2019)
  79. J. Comput. Syst. Sci. 89, 432–449 (2017)
  80. In: AAMAS, pp. 2142–2144 (2018)
  81. In: IJCAI, pp. 425–431 (2013)
Citations (6)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now