Geometry of online packing linear programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7391 LNCS, Issue PART 1, 2012, Pages 701-713

  Molinaro, Marco ^a   Ravi, R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE ALGORITHMS; DECISION VARIABLES; FEASIBLE SOLUTION; LEARNING PROBLEM; LINEAR CLASSIFICATION; LINEAR CLASSIFIERS; ONLINE DECISIONS; RIGHT-HAND SIDES;

ALGORITHMS;

AUTOMATA THEORY;

EID: 84883758510     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31594-7_59     Document Type: Conference Paper

References (23)

1. Agrawal, S., Wang, Z., Ye, Y.: A dynamic near-optimal algorithm for online linear programming, http://arxiv.org/abs/0911.2974
2. Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA (2009)
3. Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.D.: A Knapsack Secretary Problem with Applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 16-28. Springer, Heidelberg (2007)
4. Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exchanges 7(2) (2008)
5. Bateni, M., Hajiaghayi, M., Zadimoghaddam, M.: Submodular Secretary Problem and Extensions. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX and RANDOM 2010, LNCS, vol. 6302, pp. 39-52. Springer, Heidelberg (2010)
6. Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer Series in Operations Research and Financial Engineering. Springer (1997)
7. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)
8. Buchbinder, N., Naor, J.S.: Online primal-dual algorithms for covering and packing. Mathematics of Operations Research 34, 270-286 (2009)
9. Cucker, F., Zhou, D.X.: Learning Theory: An Approximation Theory Viewpoint. Cambridge University Press (2007)
10. Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: EC (2011)
11. Devenur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: EC (2009)
12. Devroye, L., Wagner, T.: Distribution-free performance bounds for potential function rules. IEEE Transactions on Information Theory 25, 601-604 (1979)
13. Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Soviet Mathematics Doklady 4 (1963)
14. Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online Stochastic Packing Applied to Display Ad Allocation. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 182-194. Springer, Heidelberg (2010)
15. Gilbert, J.P., Mosteller, F.: Recognizing the Maximum of a Sequence. Journal of the American Statistical Association 61(313), 35-73 (1966)
16. Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA (2008)
17. Im, S., Wang, Y.: Secretary problems: Laminar matroid and interval scheduling. In: SODA (2011)
18. Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC (1990)
19. Kenyon, C.: Best-fit bin-packing with random order. In: SODA (1996)
20. Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA (2005)
21. Kutin, S., Niyogi, P.: Almost-everywhere algorithmic stability and generalization error. In: Uncertainty in Artificial Intelligence, pp. 275-282 (2002)
22. Molinaro, M., Ravi, R.: Geometry of online packing linear programs, http://arxiv.org/abs/1204.5810
23. Soto, J.A.: Matroid secretary problem in the random assignment model. In: SODA (2011)