暂无分享,去创建一个
Piotr Faliszewski | Edith Elkind | Pasin Manurangsi | Ulrike Schmidt-Kraepelin | Warut Suksompong | Ayumi Igarashi
[1] D. Marc Kilgour,et al. Approval Balloting for Multi-winner Elections , 2010 .
[2] Piotr Faliszewski,et al. Multiwinner Voting: A New Challenge for Social Choice Theory , 2017 .
[3] Pasin Manurangsi,et al. Losing Treewidth by Separating Subsets , 2019, SODA.
[4] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[5] Douglas Muzzio,et al. APPROVAL VOTING , 1983 .
[6] Sanjeev Arora,et al. Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.
[7] Craig Boutilier,et al. Social Choice : From Consensus to Personalized Decision Making , 2011 .
[8] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[9] Edith Elkind,et al. Structure in Dichotomous Preferences , 2015, IJCAI.
[10] Piotr Faliszewski,et al. An Experimental View on Committees Providing Justified Representation , 2019, IJCAI.
[11] Piotr Faliszewski,et al. Multiwinner Elections with Diversity Constraints , 2017, AAAI.
[12] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] Piotr Faliszewski,et al. An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections , 2021, AAAI.
[15] Yongjie Yang,et al. On the Tree Representations of Dichotomous Preferences , 2019, IJCAI.