暂无分享,去创建一个
[1] Toby Walsh,et al. The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods , 2017, AAAI.
[2] Moshe Babaioff,et al. Fair and Truthful Mechanisms for Dichotomous Valuations , 2020, ArXiv.
[3] Jonathan Turner. Maximium Priority Matchings , 2015, ArXiv.
[4] Jérôme Monnot,et al. On regular and approximately fair allocations of indivisible goods , 2014, AAMAS.
[5] Siddharth Barman,et al. Matroid Constrained Fair Allocation Problem , 2019, AAAI.
[6] James G. Oxley,et al. Matroid theory , 1992 .
[7] Alexandros Hollender,et al. Maximum Nash Welfare and Other Stories About EFX , 2020, IJCAI.
[8] Eric Budish,et al. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.
[9] Judd B. Kessler,et al. Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation , 2015, Oper. Res..
[10] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.
[11] Joachim Schauer,et al. Maximizing Nash Product Social Welfare in Allocating Indivisible Goods , 2014, Eur. J. Oper. Res..
[12] Siddharth Barman,et al. Fair Division Under Cardinality Constraints , 2018, IJCAI.
[13] David Manlove,et al. Matching under Preferences , 2014, Handbook of Computational Social Choice.
[14] Rohit Vaish,et al. Greedy Algorithms for Maximizing Nash Social Welfare , 2018, AAMAS.
[15] Kathryn L. Nyman,et al. Discrete Envy-free Division of Necklaces and Maps , 2015, 1510.02132.
[16] Cheng Long,et al. On Good and Fair Paper-Reviewer Assignment , 2013, 2013 IEEE 13th International Conference on Data Mining.
[17] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[18] R. Brualdi,et al. Exchange systems, matchings, and transversals , 1968 .
[19] Kurt Mehlhorn,et al. Assigning Papers to Referees , 2009, Algorithmica.
[20] Sibel Adali,et al. Mechanism Design for Multi-Type Housing Markets , 2016, AAAI.
[21] Lirong Xia,et al. Allocating Indivisible Items in Categorized Domains , 2015, IJCAI.
[22] Edith Elkind,et al. Fair Division of a Graph , 2017, IJCAI.
[23] Jérôme Monnot,et al. Near Fairness in Matroids , 2014, ECAI.
[24] Y. Narahari,et al. Groupwise Maximin Fair Allocation of Indivisible Goods , 2017, AAAI.
[25] Jonathan Turner. Faster Maximium Priority Matchings in Bipartite Graphs , 2015, ArXiv.
[26] Yair Zick,et al. Finding Fair and Efficient Allocations for Matroid Rank Valuations , 2020, SAGT.
[27] Sylvain Bouveret,et al. Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.
[28] Vittorio Bilò,et al. Almost Envy-Free Allocations with Connected Bundles , 2018, ITCS.
[29] Yasunori Okumura,et al. Priority matchings revisited , 2014, Games Econ. Behav..
[30] R. Brualdi. Comments on bases in dependence structures , 1969, Bulletin of the Australian Mathematical Society.
[31] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[32] Alvin E. Roth,et al. Pairwise Kidney Exchange , 2004, J. Econ. Theory.
[33] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[34] Francis Edward Su,et al. Fair division with multiple pieces , 2017, Discret. Appl. Math..
[35] Ariel D. Procaccia,et al. Fair Division with Binary Valuations: One Rule to Rule Them All , 2020, WINE.
[36] Jérôme Monnot,et al. A Protocol for Cutting Matroids Like Cakes , 2013, WINE.
[37] Ariel D. Procaccia,et al. The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.
[38] Joseph E. Bonin,et al. An infinite family of excluded minors for strong base-orderability , 2015 .
[39] Xiaohui Bei,et al. Connected Fair Allocation of Indivisible Goods , 2019, ArXiv.
[40] Jérôme Monnot,et al. On maximin share allocations in matroids , 2019, Theor. Comput. Sci..
[41] Sibel Adali,et al. Mechanism Design for Multi-Type Housing Markets with Acceptable Bundles , 2019, AAAI.
[42] Toby Walsh,et al. Online Fair Division: Analysing a Food Bank Problem , 2015, IJCAI.