Budgeted Allocations in the Full-Information Setting
暂无分享,去创建一个
[1] Torben Hagerup,et al. Algorithm Theory - SWAT 2004 , 2004, Lecture Notes in Computer Science.
[2] Rajiv Gandhi,et al. Dependent rounding and its applications to approximation algorithms , 2006, JACM.
[3] Vijay Kumar,et al. Approximation Algorithms for Budget-Constrained Auctions , 2001, RANDOM-APPROX.
[4] 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.
[5] Claire Mathieu,et al. Improved Approximation Algorithms for Budgeted Allocations , 2008, ICALP.
[6] R. Vohra,et al. Algorithmic Game Theory: Sponsored Search Auctions , 2007 .
[7] Michael Hoffmann,et al. Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings , 2007, ESA.
[8] Yishay Mansour,et al. Auctions with Budget Constraints , 2004, SWAT.
[9] Aranyak Mehta,et al. AdWords and Generalized On-line Matching , 2005, FOCS.
[10] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[11] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[12] Uriel Feige,et al. Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[13] Aravind Srinivasan,et al. Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[14] Maxim Sviridenko,et al. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..
[15] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.