Author:
Gupta Anupam,Hu Jinqiao,Kehne Gregory,Levin Roie
Publisher
Springer Nature Switzerland
Reference32 articles.
1. Adamczyk, M., Wlodarczyk, M.: Random order contention resolution schemes. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, 7–9 October 2018, pp. 790–801. IEEE Computer Society (2018)
2. Arsenis, M., Drosis, O., Kleinberg, R.: Constrained-order prophet inequalities. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, 10–13 January 2021, pp. 2034–2046. SIAM (2021)
3. Azar, P.D., Kleinberg, R., Weinberg, S.M.: Prophet inequalities with limited information. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5–7 January 2014, pp. 1358–1377. SIAM (2014)
4. Azar, P.D., Kleinberg, R., Weinberg, S.M.: Prior independent mechanisms via prophet inequalities with limited information. Games Econ. Behav. 118, 511–532 (2019)
5. Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4–6 January 2009, pp. 1245–1254. SIAM (2009)