暂无分享,去创建一个
Lirong Xia | Rohit Vaish | Jun Wang | Sujoy Sikdar | Hadi Hosseini | Hadi Hosseini | Lirong Xia | Rohit Vaish | Sujoy Sikdar | Jun Wang
[1] Xin Huang,et al. Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items , 2019, EC.
[2] Eric Budish,et al. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.
[3] Erel Segal-Halevi,et al. Efficient Fair Division with Minimal Sharing , 2019 .
[4] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2019, ACM Trans. Economics and Comput..
[5] Bo Li,et al. Maximin-Aware Allocations of Indivisible Goods , 2019, AAMAS.
[6] Vincent Conitzer,et al. Fair Public Decision Making , 2016, EC.
[7] Jérôme Lang,et al. Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity , 2005, IJCAI.
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Jon M. Kleinberg,et al. Fair Division via Social Comparison , 2016, AAMAS.
[10] Jörg Rothe,et al. Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods , 2014, Discret. Appl. Math..
[11] Ariel D. Procaccia,et al. Spliddit: unleashing fair division algorithms , 2015, SECO.
[12] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[13] D. Foley. Resource allocation and the public sector , 1967 .
[14] Youming Qiao,et al. Networked Fairness in Cake Cutting , 2017, IJCAI.
[15] Nisarg Shah,et al. Fair Division with Subsidy , 2019, SAGT.
[16] Erel Segal-Halevi,et al. Fair Division with Minimal Sharing , 2019, ArXiv.
[17] Yann Chevaleyre,et al. Distributed fair allocation of indivisible goods , 2017, Artif. Intell..
[18] Vincent Conitzer,et al. Group Fairness for Indivisible Goods Allocation , 2019 .
[19] Yann Chevaleyre,et al. Local envy-freeness in house allocation problems , 2018, Autonomous Agents and Multi-Agent Systems.
[20] Yiling Chen,et al. Ignorance is Often Bliss : Envy with Incomplete Information , 2017 .
[21] Ioannis Caragiannis,et al. Knowledge, Fairness, and Social Constraints , 2018, AAAI.
[22] Andreas Krause,et al. Submodular Function Maximization , 2014, Tractability.
[23] Kurt Mehlhorn,et al. A Little Charity Guarantees Almost Envy-Freeness , 2019, SODA.
[24] Ariel D. Procaccia,et al. The Computational Rise and Fall of Fairness , 2014, AAAI.
[25] Toby Walsh,et al. Fair assignment of indivisible objects under ordinal preferences , 2013, AAMAS.
[26] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[27] E. Markakis. Approximation Algorithms and Hardness Results for Fair Division with Indivisible Goods , 2017 .
[28] Rohit Vaish,et al. Finding Fair and Efficient Allocations , 2017, EC.
[29] Klaudia Frankfurter. Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .
[30] Rolf Niedermeier,et al. Envy-Free Allocations Respecting Social Networks , 2018, AAMAS.
[31] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[32] Pasin Manurangsi,et al. When Do Envy-Free Allocations Exist? , 2018, AAAI.