暂无分享,去创建一个
[1] Eric J. Friedman,et al. Dynamic Fair Division with Minimal Disruptions , 2015, EC.
[2] Edith Elkind,et al. Fair Division of a Graph , 2017, IJCAI.
[3] Yann Chevaleyre,et al. Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] Youming Qiao,et al. Networked Fairness in Cake Cutting , 2017, IJCAI.
[6] Yann Chevaleyre,et al. Distributed fair allocation of indivisible goods , 2017, Artif. Intell..
[7] Eric J. Friedman,et al. Controlled Dynamic Fair Division , 2017, EC.
[8] Ariel D. Procaccia,et al. Achieving a Fairer Future by Changing the Past , 2019, IJCAI.
[9] Sen Huang,et al. Object Reachability via Swaps along a Line , 2019, AAAI.
[10] Rolf Niedermeier,et al. Envy-Free Allocations Respecting Social Networks , 2018, AAMAS.
[11] Laurent Gourvès,et al. Object Allocation via Swaps along a Social Network , 2017, IJCAI.
[12] Jörg Rothe,et al. Optimizing Social Welfare in Social Networks , 2019, ADT.
[13] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[14] Jörg Rothe,et al. A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation , 2013, Annals of Mathematics and Artificial Intelligence.
[15] Eric Budish,et al. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.
[16] Yann Chevaleyre,et al. Local envy-freeness in house allocation problems , 2018, Autonomous Agents and Multi-Agent Systems.
[17] Ioannis Caragiannis,et al. Knowledge, Fairness, and Social Constraints , 2018, AAAI.
[18] Ioannis Caragiannis,et al. Computing envy-freeable allocations with limited subsidies , 2020, ArXiv.
[19] Rainer Alt,et al. Sharing Economy , 2016, Bus. Inf. Syst. Eng..
[20] Siddharth Barman,et al. Fair Division Under Cardinality Constraints , 2018, IJCAI.
[21] Adrian Vetta,et al. One Dollar Each Eliminates Envy , 2019, EC.
[22] Nisarg Shah,et al. Fair Division with Subsidy , 2019, SAGT.
[23] Kurt Mehlhorn,et al. A Little Charity Guarantees Almost Envy-Freeness , 2019, SODA.
[24] Robert Ganian,et al. Parameterized Complexity of Envy-Free Resource Allocation in Social Networks , 2020, AAAI.
[25] Yann Chevaleyre,et al. Allocating Goods on a Graph to Eliminate Envy , 2007, AAAI.
[26] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.
[27] Laurie A. Williams,et al. Strengthening the Case for Pair Programming , 2000, IEEE Softw..
[28] Jon M. Kleinberg,et al. Fair Division via Social Comparison , 2016, AAMAS.
[29] Erel Segal-Halevi,et al. Fair Division with Minimal Sharing , 2019, ArXiv.
[30] Jérôme Lang,et al. Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity , 2005, IJCAI.
[31] Erel Segal-Halevi,et al. Fair Division with Bounded Sharing , 2019, ArXiv.
[32] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[33] Rohit Vaish,et al. Finding Fair and Efficient Allocations , 2017, EC.
[34] Xin Huang,et al. Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items , 2019, EC.