The Submodular Welfare Problem with Demand Queries
暂无分享,去创建一个
[1] Joe A. Oppenheimer,et al. Steven J. Brams and Alan D. Taylor, Fair division: From cake cutting to dispute resolution. , 1997 .
[2] Noam Nisan,et al. Approximation algorithms for combinatorial auctions with complement-free bidders , 2005, STOC '05.
[3] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[4] Jan Vondrák,et al. Submodularity in Combinatorial Optimization , 2007 .
[5] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[6] Uriel Feige,et al. Approximating the domatic number , 2000, STOC '00.
[7] Oded Schwartz,et al. On the Complexity of Approximating k-Dimensional Matching , 2003, RANDOM-APPROX.
[8] Aranyak Mehta,et al. Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions , 2005, Algorithmica.
[9] Shahar Dobzinski,et al. An improved approximation algorithm for combinatorial auctions with submodular bidders , 2006, SODA '06.
[10] Noam Nisan,et al. The communication requirements of efficient allocations and supporting prices , 2006, J. Econ. Theory.
[11] Steven J. Brams,et al. Fair division - from cake-cutting to dispute resolution , 1998 .
[12] Jan Vondrák,et al. Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.
[13] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[14] Gagan Goel,et al. On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[15] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[16] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[17] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.