On regular and approximately fair allocations of indivisible goods
暂无分享,去创建一个
[1] Subhash Khot,et al. Approximation Algorithms for the Max-Min Allocation Problem , 2007, APPROX-RANDOM.
[2] James G. Oxley,et al. Matroid theory , 1992 .
[3] Jérôme Lang,et al. Allocation of indivisible goods: a general model and some complexity results , 2005, AAMAS '05.
[4] Venkatesan Guruswami,et al. MaxMin allocation via degree lower-bounded arborescences , 2009, STOC '09.
[5] Jérôme Monnot,et al. A Matroid Approach to the Worst Case Allocation of Indivisible Goods , 2013, IJCAI.
[6] Sanjeev Khanna,et al. On Allocating Goods to Maximize Fairness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Ivona Bezáková,et al. Allocating indivisible goods , 2005, SECO.
[9] Amin Saberi,et al. An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.
[10] Han Hoogeveen,et al. Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard , 2004, J. Sched..
[11] 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.
[12] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[13] D. Golovin. Max-min fair allocation of indivisible goods , 2005 .
[14] Nikhil Bansal,et al. The Santa Claus problem , 2006, STOC '06.