Argyrios Deligkas

인용

	전체	2020년 이후
서지정보	696	559
h-index	16	14
i10-index	26	23

200

100

150

2014201520162017201820192020202120222023202420254 6 20 33 28 31 39 61 106 123 188 34

공개 액세스

모두 보기

자료 29개

자료 0개

공개

비공개

재정 지원 요구사항 기준

공동 저자

John FearnleyUniversity of Liverpoolliverpool.ac.uk의 이메일 확인됨
Paul SpirakisProfessor of Computer Science U. Liverpool and U. Patrasliverpool.ac.uk의 이메일 확인됨
Rahul SavaniProfessor of Computer Science, University of Liverpool and Alan Turing Instituteliverpool.ac.uk의 이메일 확인됨
Themistoklis MelissourgosUniversity of Essexessex.ac.uk의 이메일 확인됨
Eduard EibenLecturer in Computer Science, Royal Holloway, Univeristy of Londonrhul.ac.uk의 이메일 확인됨
Igor PotapovProfessor, Department of Computer Science, University of Liverpoolliverpool.ac.uk의 이메일 확인됨
Vladimir V. GusevUniversity of Liverpoolliverpool.ac.uk의 이메일 확인됨
Duncan AdamsonUniversity of Liverpoolliverpool.ac.uk의 이메일 확인됨
Alexandros HollenderPost-Doctoral Research Fellow, All Souls College, University of Oxfordcs.ox.ac.uk의 이메일 확인됨
Aris Filos-RatsikasUniversity of Edinburghed.ac.uk의 이메일 확인됨
Michail FasoulakisAssistant Professor in (Theoretical) Computer Science at Royal Holloway, University of London, UKrhul.ac.uk의 이메일 확인됨
George B. MertziosAssociate Professor, Durham Universitydurham.ac.uk의 이메일 확인됨
Tiger-Lily GoldsmithRoyal Holloway, University of Londonrhul.ac.uk의 이메일 확인됨
Alexandros A. VoudourisCSEE, University of Essexessex.ac.uk의 이메일 확인됨
Robert GanianTU Wienac.tuwien.ac.at의 이메일 확인됨
Mingyu GuoSenior Lecturer at School of Computer and Mathematical Sciences, University of Adelaideadelaide.edu.au의 이메일 확인됨
George SkretasHasso Plattner Institutehpi.de의 이메일 확인됨
Artur CzumajProfessor of Computer Science, University of Warwick, UKwarwick.ac.uk의 이메일 확인됨
Marcin JurdzińskiUniversity of Warwick, Department of Computer Sciencewarwick.ac.uk의 이메일 확인됨
Dmytro AntypovLiverpool, Cambridge, Mainz, Sheffieldliverpool.ac.uk의 이메일 확인됨

팔로우

Argyrios Deligkas

Royal Holloway University of London

rhul.ac.uk의 이메일 확인됨 - 홈페이지

algorithms computational complexity algorithmic game theory mechanism design


제목 서지정보순 정렬 연도순 정렬 제목순 정렬	인용 인용	연도
Computing approximate Nash equilibria in polymatrix games A Deligkas, J Fearnley, R Savani, P Spirakis Algorithmica 77 (2), 487-514, 2017	59	2017
Heterogeneous facility location games E Anastasiadis, A Deligkas arXiv preprint arXiv:2005.03095, 2020	44	2020
Revenue maximization via hiding item attributes M Guo, A Deligkas arXiv preprint arXiv:1302.5332, 2013	37	2013
Optimality guarantees for crystal structure prediction VV Gusev, D Adamson, A Deligkas, D Antypov, CM Collins, P Krysta, ... Nature 619 (7968), 68-72, 2023	33	2023
Inapproximability results for constrained approximate Nash equilibria A Deligkas, J Fearnley, R Savani Information and Computation 262, 40-56, 2018	33*	2018
Optimizing reachability sets in temporal graphs by delaying A Deligkas, I Potapov Information and Computation 285, 104890, 2022	32	2022
Learning approximately optimal contracts A Cohen, A Deligkas, M Koren International Symposium on Algorithmic Game Theory, 331-346, 2022	25	2022
Heterogeneous facility location with limited resources A Deligkas, A Filos-Ratsikas, AA Voudouris Games and Economic Behavior 139, 200-215, 2023	23	2023
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
Tree polymatrix games are ppad-hard A Deligkas, J Fearnley, R Savani arXiv preprint arXiv:2002.12119, 2020	22	2020
The Parameterized Complexity of Connected Fair Division. A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak IJCAI, 139-145, 2021	20	2021
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
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
An empirical study on computing equilibria in polymatrix games A Deligkas, J Fearnley, TP Igwe, R Savani arXiv preprint arXiv:1602.06865, 2016	19	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	19	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	18	2022
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	15	2023
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
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	14	2020

현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.

학술자료 1–20

연간 인용횟수

중복된 서지정보

병합된 서지정보

공동 저자 추가공동 저자

팔로우

인용

공동 저자