Author:
Fikioris Giannis,Fotakis Dimitris
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
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. -F., Haghtalab, N., White, C.: k-Center clustering under perturbation resilience. In: Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016), volume 55 of LIPIcs, pp 68:1–68:14 (2016)