Author:
Buchbinder Niv,Jain Kamal,Singh Mohit
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Awerbuch, B., Azar, Y., Meyerson, A.: Reducing Truth-Telling Online Mechanisms to Online Optimization. In: Proceedings of ACM Symposium on Theory of Computing, pp. 503–510 (2003)
2. Lecture Notes in Computer Science;M. Babaioff,2007
3. Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online Auctions and Generalized Secretary Problems. SIGecom Exchange 7, 1–11 (2008)
4. Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, Secretary Problems, and Online Mechanisms. In: Proceedings 18th ACM-SIAM Symposium on Discrete Algorithms (2007)
5. Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA ’09: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, pp. 1245–1254. Society for Industrial and Applied Mathematics, Philadelphia (2009)
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献