Argyrios Deligkas

Cited by

	All	Since 2019
Citations	620	518
h-index	16	15
i10-index	25	22

160

120

201420152016201720182019202020212022202320244 6 20 33 28 31 39 61 104 132 142

Public access

View all

28 articles

0 articles

available

not available

Based on funding mandates

Co-authors

John FearnleyUniversity of LiverpoolVerified email at liverpool.ac.uk
Paul SpirakisProfessor of Computer Science U. Liverpool and U. PatrasVerified email at liverpool.ac.uk
Rahul SavaniProfessor of Computer Science, University of Liverpool and Alan Turing InstituteVerified email at liverpool.ac.uk
Themistoklis MelissourgosUniversity of EssexVerified email at essex.ac.uk
Eduard EibenLecturer in Computer Science, Royal Holloway, Univeristy of LondonVerified email at rhul.ac.uk
Igor PotapovProfessor, Department of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Vladimir V. GusevUniversity of LiverpoolVerified email at liverpool.ac.uk
Duncan AdamsonUniversity of LiverpoolVerified email at liverpool.ac.uk
Alexandros HollenderPost-Doctoral Research Fellow, All Souls College, University of OxfordVerified email at cs.ox.ac.uk
Aris Filos-RatsikasUniversity of EdinburghVerified email at ed.ac.uk
Michail FasoulakisICS-FORTH, GreeceVerified email at ics.forth.gr
George B. MertziosAssociate Professor, Durham UniversityVerified email at durham.ac.uk
Tiger-Lily GoldsmithRoyal Holloway, University of LondonVerified email at rhul.ac.uk
Alexandros A. VoudourisCSEE, University of EssexVerified email at essex.ac.uk
Robert GanianTU WienVerified email at ac.tuwien.ac.at
Mingyu GuoSenior Lecturer of School of Computer and Mathematical Sciences, University of AdelaideVerified email at adelaide.edu.au
Artur CzumajProfessor of Computer Science, University of Warwick, UKVerified email at warwick.ac.uk
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
George SkretasHasso Plattner InstituteVerified email at hpi.de
Sebastian OrdyniakUniversity of LeedsVerified email at sheffield.ac.uk

Argyrios Deligkas

Royal Holloway University of London

Verified email at rhul.ac.uk - Homepage

algorithms computational complexity algorithmic game theory mechanism design


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Computing approximate Nash equilibria in polymatrix games A Deligkas, J Fearnley, R Savani, P Spirakis Algorithmica 77 (2), 487-514, 2017	52	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	22	2023
Optimality guarantees for crystal structure prediction VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ... Nature 619 (7968), 68-72, 2023	21	2023
Tree polymatrix games are ppad-hard A Deligkas, J Fearnley, R Savani arXiv preprint arXiv:2002.12119, 2020	21	2020
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
Learning approximately optimal contracts A Cohen, A Deligkas, M Koren International Symposium on Algorithmic Game Theory, 331-346, 2022	19	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	19	2021
The Parameterized Complexity of Connected Fair Division. A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak IJCAI, 139-145, 2021	18	2021
An empirical study on computing equilibria in polymatrix games A Deligkas, J Fearnley, TP Igwe, R Savani arXiv preprint arXiv:1602.06865, 2016	18	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	17	2022
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	17	2016
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	15	2022
Ranking bracelets in polynomial time D Adamson, A Deligkas, VV Gusev, I Potapov arXiv preprint arXiv:2104.04324, 2021	15	2021
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	13	2022
On the hardness of energy minimisation for crystal structure prediction D Adamson, A Deligkas, VV Gusev, I Potapov SOFSEM 2020: Theory and Practice of Computer Science: 46th International …, 2020	13	2020

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors