Computing approximate Nash equilibria in polymatrix games A Deligkas, J Fearnley, R Savani, P Spirakis Algorithmica 77 (2), 487-514, 2017 | 50 | 2017 |
Heterogeneous facility location games E Anastasiadis, A Deligkas arXiv preprint arXiv:2005.03095, 2020 | 41 | 2020 |
Revenue maximization via hiding item attributes M Guo, A Deligkas arXiv preprint arXiv:1302.5332, 2013 | 37 | 2013 |
Inapproximability results for constrained approximate Nash equilibria A Deligkas, J Fearnley, R Savani Information and Computation 262, 40-56, 2018 | 32* | 2018 |
Optimizing reachability sets in temporal graphs by delaying A Deligkas, I Potapov Information and Computation 285, 104890, 2022 | 27 | 2022 |
Computing exact solutions of consensus halving and the Borsuk-Ulam theorem A Deligkas, J Fearnley, T Melissourgos, PG Spirakis Journal of Computer and System Sciences 117, 75-98, 2021 | 23 | 2021 |
Heterogeneous facility location with limited resources A Deligkas, A Filos-Ratsikas, AA Voudouris Games and Economic Behavior 139, 200-215, 2023 | 21 | 2023 |
Distributed methods for computing approximate equilibria A Czumaj, A Deligkas, M Fasoulakis, J Fearnley, M Jurdziński, R Savani Algorithmica 81, 1205-1231, 2019 | 20 | 2019 |
Tree polymatrix games are ppad-hard A Deligkas, J Fearnley, R Savani arXiv preprint arXiv:2002.12119, 2020 | 19 | 2020 |
The Parameterized Complexity of Connected Fair Division. A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak IJCAI, 139-145, 2021 | 18 | 2021 |
Optimality guarantees for crystal structure prediction VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ... Nature 619 (7968), 68-72, 2023 | 16 | 2023 |
On the hardness of energy minimisation for crystal structure prediction D Adamson, A Deligkas, V Gusev, I Potapov Fundamenta Informaticae 184, 2022 | 16 | 2022 |
Two's company, three's a crowd: Consensus-halving for a constant number of agents A Deligkas, A Filos-Ratsikas, A Hollender Proceedings of the 22nd ACM Conference on Economics and Computation, 347-368, 2021 | 16 | 2021 |
An empirical study on computing equilibria in polymatrix games A Deligkas, J Fearnley, TP Igwe, R Savani arXiv preprint arXiv:1602.06865, 2016 | 16 | 2016 |
Distributed methods for computing approximate equilibria A Czumaj, A Deligkas, M Fasoulakis, J Fearnley, M Jurdziński, R Savani Web and Internet Economics: 12th International Conference, WINE 2016 …, 2016 | 16 | 2016 |
Pure-circuit: Strong inapproximability for PPAD A Deligkas, J Fearnley, A Hollender, T Melissourgos 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
Learning approximately optimal contracts A Cohen, A Deligkas, M Koren International Symposium on Algorithmic Game Theory, 331-346, 2022 | 14 | 2022 |
Constant inapproximability for PPA A Deligkas, J Fearnley, A Hollender, T Melissourgos Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 13 | 2022 |
Approximating the existential theory of the reals A Deligkas, J Fearnley, T Melissourgos, PG Spirakis Journal of Computer and System Sciences 125, 106-128, 2022 | 12 | 2022 |
Ranking bracelets in polynomial time D Adamson, A Deligkas, VV Gusev, I Potapov arXiv preprint arXiv:2104.04324, 2021 | 12 | 2021 |