Publisher
Springer Nature Switzerland
Reference36 articles.
1. Alaei, S.: Bayesian combinatorial auctions: expanding single buyer mechanisms to many buyers. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 512–521 (2011)
2. Alaei, S., Hajiaghayi, M., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012. ACM Press (2012)
3. Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 434–443. SIAM (2007)
4. Blum, A., Caragiannis, I., Haghtalab, N., Procaccia, A.D., Procaccia, E.B., Vaish, R.: Opting into optimal matchings. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, pp. 2351–2363. SIAM (2017)
5. Boucheron, S., Lugosi, G., Massart, P.: A sharp concentration inequality with application. Random Struct. Algorithms 16(3), 277–292 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献