Online matching with concave returns

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 137-143

  Devanur, Nikhil R ^a   Jain, Kamal ^b  

^a MICROSOFT RESEARCH   (United States)

^b EBAY INC   (United States)

Author keywords

adwords; bipartite matching; concave returns; online

Indexed keywords

ADWORDS; BIPARTITE MATCHINGS; CALCULUS OF VARIATIONS; COMPETITIVE RATIO; CONCAVE FUNCTION; CONCAVE RETURNS; CONTINUOUS FUNCTIONS; LINEAR FUNCTIONS; OBJECTIVE FUNCTIONS; ON-LINE MATCHING; ONLINE; OPTIMAL COMPETITIVE RATIOS; OPTIMIZATION PROBLEMS; PRIMAL-DUAL; UPPER BOUND;

ALGORITHMS; DIFFERENTIAL EQUATIONS; MOLECULAR PHYSICS; OPTIMIZATION;

COMPUTATION THEORY;

EID: 84862588700     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2213992     Document Type: Conference Paper

References (19)

1. G. Aggarwal, G. Goel, C. Karande, and A. Mehta. Online vertex-weighted bipartite matching and single-bid budgeted allocations. In SODA, pages 1253-1264, 2011.
2. S. Agrawal, Z. Wang, and Y. Ye. A dynamic near-optimal algorithm for online linear programming. arXiv:0911.2974v1, 2009.
3. B. Bahmani and M. Kapralov. Improved bounds for online stochastic matching. In ESA, pages 170-181, 2010.
4. N. Buchbinder, K. Jain, and J. S. Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In ESA'07: Proceedings of the 15th annual European conference on Algorithms, pages 253-264, Berlin, Heidelberg, 2007. Springer-Verlag.
5. N. R. Devanur and T. P. Hayes. The adwords problem: online keyword matching with budgeted bidders under random permutations. In J. Chuang, L. Fortnow, and P. Pu, editors, ACM Conference on Electronic Commerce, pages 71-78. ACM, 2009.
6. N. R. Devanur, K. Jain, B. Sivan, and C. A. Wilkens. Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In Y. Shoham, Y. Chen, and T. Roughgarden, editors, ACM Conference on Electronic Commerce, pages 29-38. ACM, 2011.
7. J. Feldman, M. Henzinger, N. Korula, V. S. Mirrokni, and C. Stein. Online stochastic packing applied to display ad allocation. In ESA, pages 182-194, 2010.
8. J. Feldman, A. Mehta, V. Mirrokni, and S. Muthukrishnan. Online stochastic matching: Beating 1-1/e. In FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pages 117-126, Washington, DC, USA, 2009. IEEE Computer Society.
9. G. Goel and A. Mehta. Online budgeted matching in random input models with applications to adwords. In SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 982-991, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
10. B. Kalyanasundaram and K. R. Pruhs. An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci., 233(1-2):319-325, 2000.
11. C. Karande, A. Mehta, and P. Tripathi. Online bipartite matching with unknown distributions. In STOC, pages 587-596, 2011.
12. R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for on-line bipartite matching. In STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 352-358, 1990.
13. F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33-37, 1997.
14. M. Mahdian and Q. Yan. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps. In STOC, pages 597-606, 2011.
15. V. H. Manshadi, S. O. Gharan, and A. Saberi. Online stochastic matching: Online actions based on offline statistics. In SODA, pages 1285-1294, 2011.
16. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized on-line matching. In In FOCS âǍŹ05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 264-273. IEEE Computer Society, 2005.
17. R. Myerson. Optimal auction design. Mathematics of Operations Research, 6(1):58-73, 1981.
18. H. Sagan. Introduction to the Calculus of Variations. Dover Publications Inc., 1969.
19. D. WIlliams. Probability with Martingales. Cambridge University Press, 1991.