The Maximin Support Method: An Extension of the D'Hondt Method to Approval-Based Multiwinner Elections
暂无分享,去创建一个
Luis Sánchez-Fernández | Markus Brill | Jesús Arias Fisteus | Norberto Fernández | Markus Brill | Jesús Arias-Fisteus | Norberto Fernández | L. Sánchez-Fernández
[1] Vincent Conitzer,et al. On the Axiomatic Characterization of Runoff Voting Rules , 2014, AAAI.
[2] Stephanie Boehm,et al. Electoral Systems A Comparative Introduction , 2016 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Meir Kalech,et al. Preference elicitation for narrowing the recommended list for groups , 2014, RecSys '14.
[5] Michel Balinski,et al. The Quota Method of Apportionment , 1975 .
[6] L. A. Goodman,et al. Social Choice and Individual Values , 1951 .
[7] Piotr Faliszewski,et al. Achieving fully proportional representation: Approximability results , 2013, Artif. Intell..
[8] M. Gallagher. Proportionality, disproportionality and electoral systems , 1991 .
[9] Edith Elkind,et al. Proportional Justified Representation , 2016, AAAI.
[10] D. Marc Kilgour,et al. Approval Balloting for Multi-winner Elections , 2010 .
[11] Friedrich Pukelsheim,et al. Proportional Representation: Apportionment Methods and Their Applications , 2013 .
[12] Bruno Simeone,et al. Evaluation and Optimization of Electoral Systems , 1987 .
[13] Piotr Faliszewski,et al. Multiwinner Voting: A New Challenge for Social Choice Theory , 2017 .
[14] L. G. H. Cijan. A polynomial algorithm in linear programming , 1979 .
[15] Dan W. Brockt,et al. The Theory of Justice , 2017 .
[16] Dominik Peters,et al. Proportionality and the Limits of Welfarism , 2020, EC.
[17] Craig Boutilier,et al. Social Choice : From Consensus to Personalized Decision Making , 2011 .
[18] Piotr Faliszewski,et al. Properties of multiwinner voting rules , 2014, Social Choice and Welfare.
[19] Irvin J. Lustig,et al. Gigaflops in linear programming , 1996, Oper. Res. Lett..
[20] Burt L. Monroe,et al. Fully Proportional Representation , 1995, American Political Science Review.
[21] John R. Chamberlin,et al. Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule , 1983, American Political Science Review.
[22] Joel Franklin. Convergence in Karmarkar's algorithm for linear programming , 1987 .
[23] Jean-François Laslier,et al. Introduction to the Handbook on Approval Voting , 2010 .
[24] E. Markakis,et al. Approval Voting : Local Search Heuristics and Approximation Algorithms for the Minimax Solution , 2006 .
[25] John H. Gerdes,et al. Voting mechanisms and their implications in a GDSS environment , 1997, Ann. Oper. Res..
[26] Enric Plaza. Technologies for political representation and accountability , 2004 .
[27] Alfonso Cevallos,et al. A verifiably secure and proportional committee election rule , 2020, AFT.
[28] Martin Lackner,et al. Approval-Based Committee Voting: Axioms, Algorithms, and Applications , 2020, ArXiv.
[29] Steven J. Brams,et al. Multiwinner approval voting: an apportionment approach , 2017 .
[30] Nadja Betzler,et al. On the Computation of Fully Proportional Representation , 2011, J. Artif. Intell. Res..
[31] Haris Aziz,et al. Justified representation in approval-based committee voting , 2014, Social Choice and Welfare.
[32] Vincent Conitzer,et al. Making decisions based on the preferences of multiple agents , 2010, CACM.
[33] Bruce R. Feiring. Linear Programming: An Introduction , 1986 .
[34] Edith Elkind,et al. Choosing Collectively Optimal Sets of Alternatives Based on the Condorcet Criterion , 2011, IJCAI.
[35] Jean-François Laslier,et al. Multiwinner approval rules as apportionment methods , 2016, AAAI.
[36] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[37] S. Woltran,et al. Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making , 2019 .
[38] Luis Sánchez-Fernández,et al. Some Notes on Justified Representation∗ , 2016 .
[39] Svante Janson,et al. Phragmén's and Thiele's election methods , 2016, ArXiv.
[40] Piotr Faliszewski,et al. Axiomatic Characterization of Committee Scoring Rules , 2016, J. Econ. Theory.
[41] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .
[42] Steven J. Brams,et al. How to Elect a Representative Committee Using Approval Balloting , 2006 .
[43] Henryk Wozniakowski,et al. Complexity of linear programming , 1982, Oper. Res. Lett..
[44] Jessika Daecher,et al. Comparing Voting Systems , 2016 .
[45] M. Chiani. Error Detecting and Error Correcting Codes , 2012 .
[46] Bo Särlvik,et al. Fair Representation: Meeting the Ideal of One Man, One Vote, Michel L. Balinski, H. Peyton Young. Yale University Press, New Haven (1982), xi + 191 pp. , 1983 .
[47] M. Trick,et al. Voting schemes for which it can be difficult to tell who won the election , 1989 .
[48] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[49] Svante Janson,et al. Phragmén’s voting methods and justified representation , 2017, AAAI.
[50] Tuomas Sandholm,et al. Distributed rational decision making , 1999 .
[51] Ariel D. Procaccia,et al. On the complexity of achieving proportional representation , 2008, Soc. Choice Welf..
[52] Vincent Conitzer,et al. Fair Public Decision Making , 2016, EC.
[53] Ariel D. Procaccia,et al. Socially desirable approximations for Dodgson's voting rule , 2010, EC '10.
[54] Xavier Mora,et al. Eleccions mitjançant el vot d'aprovació. El mètode de Phragmén i algunes variants , 2015 .
[55] Luis Sánchez Fernández,et al. Monotonicity axioms in approval-based multi-winner voting rules , 2017, AAMAS.
[56] Robert E. Bixby,et al. Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods , 1992, Oper. Res..
[57] Jean-Benoît Pilet,et al. Faces on the Ballot: The Personalization of Electoral Systems in Europe , 2016 .
[58] Steven J. Brams,et al. A minimax procedure for electing committees , 2007 .
[59] Piotr Faliszewski,et al. Fully Proportional Representation as Resource Allocation: Approximability Results , 2012, IJCAI.
[60] George B. Dantzig,et al. Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..
[61] I. Introduction. CAN THE MAXIMIN PRINCIPLE SERVE AS A BASIS FOR MORALITY? A CRITIQUE OF JOHN RAWLS'S THEORY*§ , 1980 .
[62] Piotr Faliszewski,et al. Finding a collective set of items: From proportional multirepresentation to group recommendation , 2014, Artif. Intell..
[63] C. C. Gonzaga. On the Complexity of Linear Programming , 1995 .
[64] Markus Brill,et al. Approval-Based Apportionment , 2019, AAAI.
[65] Dorothea Baumeister,et al. Voter Dissatisfaction in Committee Elections , 2015, AAMAS.
[66] Sanjay Ghemawat,et al. MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.
[67] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .