Fair Public Decision Making
暂无分享,去创建一个
[1] Vincent Conitzer,et al. Fair and Efficient Social Choice in Dynamic Settings , 2017, IJCAI.
[2] Ariel D. Procaccia,et al. The Distortion of Cardinal Preferences in Voting , 2006, CIA.
[3] D. Foley. Resource allocation and the public sector , 1967 .
[4] Burt L. Monroe,et al. Fully Proportional Representation , 1995, American Political Science Review.
[5] Nikhil Bansal,et al. The Santa Claus problem , 2006, STOC '06.
[6] Richard Stong,et al. Collective choice under dichotomous preferences , 2005, J. Econ. Theory.
[7] Ariel D. Procaccia,et al. Preference Elicitation For Participatory Budgeting , 2017, AAAI.
[8] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.
[9] Hans Reijnierse,et al. On finding an envy-free Pareto-optimal division , 1998, Math. Program..
[10] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[11] Eric Budish. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2011, Journal of Political Economy.
[12] Vincent Conitzer,et al. Handbook of Computational Social Choice , 2016 .
[13] Y. Cabannes. Participatory budgeting: a significant contribution to participatory democracy , 2004 .
[14] Richard Cole,et al. Approximating the Nash Social Welfare with Indivisible Items , 2018, SIAM J. Comput..
[15] Ashish Goel,et al. Knapsack Voting : Voting mechanisms for Participatory Budgeting , 2016 .
[16] Jérôme Lang,et al. Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity , 2005, IJCAI.
[17] Eric Budish,et al. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.
[18] Ulrich Endriss,et al. Nash Social Welfare in Multiagent Resource Allocation , 2009, AMEC/TADA.
[19] Ariel D. Procaccia,et al. Leximin Allocations in the Real World , 2015, EC.
[20] Haris Aziz,et al. A Generalization of Probabilistic Serial to Randomized Social Choice , 2014, AAAI.
[21] Matthias G. Raith,et al. Bidding for envy-freeness: A procedural approach to n-player fair-division problems , 2002, Soc. Choice Welf..
[22] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[23] Kamesh Munagala,et al. The Core of the Participatory Budgeting Problem , 2016, WINE.
[24] Ioannis Caragiannis,et al. The Efficiency of Fair Division , 2009, Theory of Computing Systems.
[25] Haris Aziz,et al. Justified representation in approval-based committee voting , 2014, Social Choice and Welfare.
[26] H. Varian. Equity, Envy and Efficiency , 1974 .
[27] Lirong Xia,et al. Voting in Combinatorial Domains , 2016, Handbook of Computational Social Choice.
[28] Euiwoong Lee,et al. APX-hardness of maximizing Nash social welfare with indivisible items , 2015, Inf. Process. Lett..
[29] Vincent Conitzer,et al. Fair Social Choice in Dynamic Settings , 2016 .
[30] John R. Chamberlin,et al. Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule , 1983, American Political Science Review.
[31] Steven J. Brams,et al. The undercut procedure: an algorithm for the envy-free division of indivisible items , 2009, Soc. Choice Welf..
[32] Craig Boutilier,et al. Optimal social choice functions: A utilitarian view , 2015, Artif. Intell..
[33] Felix Brandt,et al. On Popular Random Assignments , 2013, SAGT.
[34] Flip Klijn,et al. An algorithm for envy-free allocations in an economy with indivisible objects and money , 2000, Soc. Choice Welf..
[35] Ariel D. Procaccia,et al. Fair enough: guaranteeing approximate maximin shares , 2014, EC.