Publisher
Springer International Publishing
Reference30 articles.
1. Amanatidis, G., Birmpas, G., Markakis, E.: Coverage, matching, and beyond: new results on budgeted mechanism design. In: Proceedings of the 12 International Conference on Web and Internet Economics (WINE), pp. 414–428 (2016)
2. Anari, N., Haghtalab, N., Naor, S., Pokutta, S., Singh, M., Torrico, A.: Structured robust submodular maximization: Offline and online algorithms. In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (AISTATS), vol. 89, pp. 3128–3137 (2019)
3. Badanidiyuru, A., Dobzinski, S., Oren, S.: Optimization with demand oracles. In: Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, pp. 110–127. Association for Computing Machinery (2012). https://doi.org/10.1145/2229012.2229025
4. Bernstein, A., Disser, Y., Groß, M., Himburg, S.: General bounds for incremental maximization. Math. Program. (2020). https://doi.org/10.1007/s10107-020-01576-0
5. Disser, Y., Klimm, M., Megow, N., Stiller, S.: Packing a knapsack of unknown capacity. SIAM J. Discret. Math. 31(3), 1477–1497 (2017)