Author:
Göbel Oliver,Hoefer Martin,Kesselheim Thomas,Schleiden Thomas,Vöcking Berthold
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Akcoglu, K., Aspnes, J., DasGupta, B., Kao, M.-Y.: Opportunity cost algorithms for combinatorial auctions. CoRR, cs.CE/0010031 (2000)
2. Alaei, S., Hajiaghayi, M., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. In: Proc. 13th EC, pp. 18–35 (2012)
3. Lecture Notes in Computer Science;M. Babaioff,2007
4. Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proc. 18th SODA, pp. 434–443 (2007)
5. Devanur, N.R., Jain, K., Sivan, B., Wilkens, C.A.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: Proc. 12th EC, pp. 29–38 (2011)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献