An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
暂无分享,去创建一个
[1] Ivona Bezáková,et al. Allocating indivisible goods , 2005, SECO.
[2] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[3] Amin Saberi,et al. An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.
[4] Amin Saberi,et al. An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem , 2010, SODA '10.
[5] E. Jaynes. Information Theory and Statistical Mechanics , 1957 .
[6] E. Jaynes. Probability theory : the logic of science , 2003 .
[7] Nikhil Bansal,et al. The Santa Claus problem , 2006, STOC '06.
[8] Uriel Feige,et al. On allocations that maximize fairness , 2008, SODA '08.
[9] D. Golovin. Max-min fair allocation of indivisible goods , 2005 .
[10] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[11] V. Mirrokni,et al. Tight approximation algorithms for maximum general assignment problems , 2006, SODA 2006.
[12] Venkatesan Guruswami,et al. MaxMin allocation via degree lower-bounded arborescences , 2009, STOC '09.
[13] Sanjeev Khanna,et al. On Allocating Goods to Maximize Fairness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[14] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[15] Alan M. Frieze,et al. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem , 1982, Networks.
[16] Fan Chung Graham,et al. Coupling Online and Offline Analyses for Random Power Law Graphs , 2004, Internet Math..
[17] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[18] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[19] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[20] N. Alon,et al. The Probabilistic Method, Second Edition , 2000 .
[21] Amit Kumar,et al. Fairness Measures for Resource Allocation , 2006, SIAM J. Comput..
[22] Alan M. Frieze,et al. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.