Author:
Buchbinder Niv,Jain Kamal,Singh Mohit
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications,General Mathematics
Reference26 articles.
1. Awerbuch B, Azar Y, Meyerson A (2003) Reducing truth-telling online mechanisms to online optimization.Proc. ACM Sympos. Theory Comput.(ACM, New York), 503–510.
2. Online auctions and generalized secretary problems
3. Babaioff M, Immorlica N, Kleinberg R (2007a) Matroids, secretary problems, and online mechanisms. Bansal N, Pruhs K, Stein C, eds.Proc. Eighteenth Annual ACM-SIAM Sympos. Discrete Algorithms SODA '07(SIAM, Philadelphia), 434–443.
4. Babaioff M, Immorlica N, Kempe D, Kleinberg R (2007b) A knapsack secretary problem with applications.Proc. 10th Internat. Workshop on Approximation and the 11th Internat. Workshop on Randomization, Combin. Optim. Algorithms and Techniques APPROX '07/RANDOM '07, 16–28.
5. Babaioff M, Dinitz M, Gupta A, Immorlica N, Talwar K (2009) Secretary problems: Weights and discounts.SODA '09: Proc. Nineteenth Annual ACM-SIAM Sympos. Discrete Algorithms, 1245–1254.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献