Argyrios Deligkas

Cited by

	All	Since 2018
Citations	480	409
h-index	13	12
i10-index	18	17

140

105

20142015201620172018201920202021202220234 6 20 30 28 40 36 65 98 131

Public access

View all

25 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 LiverpoolVerified email at liverpool.ac.uk
Themistoklis MelissourgosUniversity of EssexVerified email at essex.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
Eduard EibenLecturer in Computer Science, Royal Holloway, Univeristy of LondonVerified email at rhul.ac.uk
Duncan AdamsonUniversity of LiverpoolVerified email at liverpool.ac.uk
Michail FasoulakisICS-FORTH, GreeceVerified email at ics.forth.gr
George B. MertziosAssociate Professor, Durham UniversityVerified email at durham.ac.uk
Alexandros HollenderPost-Doctoral Research Fellow, All Souls College, University of OxfordVerified email at cs.ox.ac.uk
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Aris Filos-RatsikasUniversity of EdinburghVerified email at ed.ac.uk
Mingyu GuoLecturer of Computer Science, University of AdelaideVerified email at adelaide.edu.au
Artur CzumajProfessor of Computer Science, University of Warwick, UKVerified email at warwick.ac.uk
Robert GanianTU WienVerified email at ac.tuwien.ac.at
Sebastian OrdyniakUniversity of LeedsVerified email at sheffield.ac.uk
Thekla HammTU WienVerified email at ac.tuwien.ac.at
Eleftherios AnastasiadisImperial College LondonVerified email at imperial.ac.uk
Alexandros A. VoudourisCSEE, University of EssexVerified email at essex.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	46	2017
Heterogeneous facility location games E Anastasiadis, A Deligkas arXiv preprint arXiv:2005.03095, 2020	38	2020
Revenue maximization via hiding item attributes M Guo, A Deligkas arXiv preprint arXiv:1302.5332, 2013	35	2013
Inapproximability results for constrained approximate Nash equilibria A Deligkas, J Fearnley, R Savani Information and Computation 262, 40-56, 2018	31*	2018
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	21	2021
Optimizing reachability sets in temporal graphs by delaying A Deligkas, I Potapov Information and Computation 285, 104890, 2022	20	2022
Tree polymatrix games are ppad-hard A Deligkas, J Fearnley, R Savani arXiv preprint arXiv:2002.12119, 2020	19	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	19	2019
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
An empirical study on computing equilibria in polymatrix games A Deligkas, J Fearnley, TP Igwe, R Savani arXiv preprint arXiv:1602.06865, 2016	15	2016
Heterogeneous facility location with limited resources A Deligkas, A Filos-Ratsikas, AA Voudouris Games and Economic Behavior 139, 200-215, 2023	14	2023
On the hardness of energy minimisation for crystal structure prediction D Adamson, A Deligkas, V Gusev, I Potapov Fundamenta Informaticae 184, 2022	14	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	13	2021
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	12	2022
The Parameterized Complexity of Connected Fair Division. A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak IJCAI, 139-145, 2021	12	2021
Lipschitz continuity and approximate equilibria A Deligkas, J Fearnley, P Spirakis International Symposium on Algorithmic Game Theory, 15-26, 2016	11	2016
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	10	2023
Ranking bracelets in polynomial time D Adamson, A Deligkas, VV Gusev, I Potapov arXiv preprint arXiv:2104.04324, 2021	10	2021
Distributed methods for computing approximate equilibria. CoRR, abs/1512.03315 A Czumaj, A Deligkas, M Fasoulakis, J Fearnley, M Jurdzinski, R Savani	9	2015
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	8	2022

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