Author:
Fikioris Giannis,Fotakis Dimitris
Publisher
Springer International Publishing
Reference38 articles.
1. Angelidakis, H., Makarychev, K., Makarychev, Y.: Algorithms for stable and perturbation-resilient problems. In: Proceedings of the 49th ACM Symposium on Theory of Computing (STOC 2017), pp. 438–451 (2017)
2. Assadi, S., Singla, S.: Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. In: Proceedings of the 60th IEEE Symposium on Foundations of Computer Science (FOCS 2019), pp. 233–248 (2019)
3. Awasthi, P., Blum, A., Sheffet, O.: Center-based clustering under perturbation stability. Inf. Process. Lett. 112(1–2), 49–54 (2012)
4. Babaioff, M., Dobzinski, S., Oren, S.: Combinatorial auctions with endowment effect. In: Proceedings of the 2018 ACM Conference on Economics and Computation (EC 2018), pp. 73–90 (2018)
5. Balcan, M., Haghtalab, N., White, C.: $$k$$-center clustering under perturbation resilience. In: Proc. of the 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016). LIPIcs, vol. 55, pp. 68:1–68:14 (2016)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献