Allocating indivisible goods
暂无分享,去创建一个
[1] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[2] Jack M. Robertson,et al. Cake-cutting algorithms - be fair if you can , 1998 .
[3] Elchanan Mossel,et al. On approximately fair allocations of indivisible goods , 2004, EC '04.
[4] Gerhard J. Woeginger,et al. When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..
[5] Carsten Lund,et al. Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[8] Hervé Moulin,et al. The proportional random allocation of indivisible units , 2002, Soc. Choice Welf..
[9] Jirí Sgall,et al. Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines , 1999, ESA.
[10] J. Neyman,et al. Consistent Estimates Based on Partially Consistent Observations , 1948 .
[11] Gerhard J. Woeginger,et al. A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..