Theo dõi
Argyrios Deligkas
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
Computing approximate Nash equilibria in polymatrix games
A Deligkas, J Fearnley, R Savani, P Spirakis
Algorithmica 77 (2), 487-514, 2017
592017
Heterogeneous facility location games
E Anastasiadis, A Deligkas
arXiv preprint arXiv:2005.03095, 2020
462020
Revenue maximization via hiding item attributes
M Guo, A Deligkas
arXiv preprint arXiv:1302.5332, 2013
372013
Optimality guarantees for crystal structure prediction
VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ...
Nature 619 (7968), 68-72, 2023
342023
Optimizing reachability sets in temporal graphs by delaying
A Deligkas, I Potapov
Information and Computation 285, 104890, 2022
342022
Inapproximability results for constrained approximate Nash equilibria
A Deligkas, J Fearnley, R Savani
Information and Computation 262, 40-56, 2018
34*2018
Learning approximately optimal contracts
A Cohen, A Deligkas, M Koren
International Symposium on Algorithmic Game Theory, 331-346, 2022
282022
Heterogeneous facility location with limited resources
A Deligkas, A Filos-Ratsikas, AA Voudouris
Games and Economic Behavior 139, 200-215, 2023
242023
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
232021
Tree polymatrix games are ppad-hard
A Deligkas, J Fearnley, R Savani
arXiv preprint arXiv:2002.12119, 2020
222020
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
212022
The Parameterized Complexity of Connected Fair Division.
A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak
IJCAI 21, 139-145, 2021
212021
Distributed methods for computing approximate equilibria
A Czumaj, A Deligkas, M Fasoulakis, J Fearnley, M Jurdziński, R Savani
Algorithmica 81, 1205-1231, 2019
202019
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
182021
An empirical study on computing equilibria in polymatrix games
A Deligkas, J Fearnley, TP Igwe, R Savani
arXiv preprint arXiv:1602.06865, 2016
182016
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
182016
On the hardness of energy minimisation for crystal structure prediction
D Adamson, A Deligkas, V Gusev, I Potapov
Fundamenta Informaticae 184, 2022
172022
A polynomial-time algorithm for 1/3-approximate Nash equilibria in bimatrix games
A Deligkas, M Fasoulakis, E Markakis
ACM Transactions on Algorithms 19 (4), 1-17, 2023
162023
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
152022
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
132022
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20