Max-min fair allocation of indivisible goods
暂无分享,去创建一个
[1] Nimrod Megiddo,et al. Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..
[2] L. Shapley,et al. On cores and indivisibility , 1974 .
[3] Marc E. Posner,et al. Linear max-min programming , 1981, Math. Program..
[4] Robert W. Irving,et al. An efficient algorithm for the “optimal” stable marriage , 1987, JACM.
[5] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[6] Toshihide Ibaraki,et al. Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.
[7] Christopher S. Tang. A Max-Min Allocation Problem: Its Solutions and Applications , 1988, Oper. Res..
[8] D. Gale,et al. Fair Allocation of Indivisible Goods and Criteria of Justice , 1991 .
[9] Éva Tardos,et al. Scheduling unrelated machines with costs , 1993, SODA '93.
[10] Arnold B. Urken,et al. Classics of social choice , 1995 .
[11] Yash P. Aneja,et al. Lexicographic bottleneck combinatorial problems , 1998, Oper. Res. Lett..
[12] C. Pearce,et al. An Efficient Algorithm for the , 1999 .
[13] Hanan Luss,et al. On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach , 1999, Oper. Res..
[14] Amit Kumar,et al. Fairness measures for resource allocation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[15] Yuval Rabani,et al. Fairness in routing and load balancing , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[16] T. Quint,et al. On the Shapley–Scarf economy: the case of multiple types of indivisible goods , 2001 .
[17] Satoru Fujishige,et al. Existence of an Equilibrium in a General Competitive Exchange Economy with Indivisible Goods and Money , 2002 .
[18] Xiaotie Deng,et al. On the complexity of equilibria , 2002, STOC '02.
[19] Vijay V. Vazirani,et al. Equitable cost allocations via primal-dual-type algorithms , 2002, STOC '02.
[20] Nikhil R. Devanur,et al. Market equilibrium via a primal-dual-type algorithm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[21] Noam Nisany,et al. The Communication Requirements of E¢cient Allocations and Supporting Lindahl Prices¤ , 2003 .
[22] Marek Karpinski,et al. Approximation Hardness of Short Symmetric Instances of MAX-3SAT , 2003, Electron. Colloquium Comput. Complex..
[23] Éva Tardos,et al. Group strategy proof mechanisms via primal-dual algorithms , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[24] Vincent Conitzer,et al. Complexity Results about Nash Equilibria , 2002, IJCAI.
[25] Amin Saberi,et al. Approximating Market Equilibria , 2003, RANDOM-APPROX.
[26] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[27] Ivona Bezáková,et al. Allocating indivisible goods , 2005, SECO.
[28] Ashish Goel,et al. Approximate majorization and fair online load balancing , 2001, TALG.