Các bài viết có thể truy cập công khai - Argyrios DeligkasTìm hiểu thêm
Có tại một số nơi: 30
Computing approximate Nash equilibria in polymatrix games
A Deligkas, J Fearnley, R Savani, P Spirakis
Algorithmica 77 (2), 487-514, 2017
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council, UK Economic and …
Inapproximability results for constrained approximate Nash equilibria
A Deligkas, J Fearnley, R Savani
Information and Computation 262, 40-56, 2018
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
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
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
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
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
The Parameterized Complexity of Connected Fair Division.
A Deligkas, E Eiben, R Ganian, T Hamm, S Ordyniak
IJCAI 21, 139-145, 2021
Các cơ quan ủy nhiệm: Austrian Science Fund, UK Engineering and Physical Sciences Research Council
Distributed methods for computing approximate equilibria
A Czumaj, A Deligkas, M Fasoulakis, J Fearnley, M Jurdziński, R Savani
Algorithmica 81, 1205-1231, 2019
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
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
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
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
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
On the hardness of energy minimisation for crystal structure prediction
D Adamson, A Deligkas, V Gusev, I Potapov
Fundamenta Informaticae 184, 2022
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
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
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council, Federal Ministry of …
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
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Binary search in graphs revisited
A Deligkas, GB Mertzios, PG Spirakis
Algorithmica 81 (5), 1757-1780, 2019
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source
A Deligkas, M Döring, E Eiben, TL Goldsmith, G Skretas
Information and Computation 299, 105171, 2024
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Pizza sharing is PPA-hard
A Deligkas, J Fearnley, T Melissourgos
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 4957-4965, 2022
Các cơ quan ủy nhiệm: Federal Ministry of Education and Research, Germany
Computing constrained approximate equilibria in polymatrix games
A Deligkas, J Fearnley, R Savani
International Symposium on Algorithmic Game Theory, 93-105, 2017
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Tight inapproximability for graphical games
A Deligkas, J Fearnley, A Hollender, T Melissourgos
Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 5600-5607, 2023
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
The parameterized complexity of welfare guarantees in Schelling segregation
A Deligkas, E Eiben, TL Goldsmith
Theoretical Computer Science 1017, 114783, 2024
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council, UK Research & Innovation
The complexity of periodic energy minimisation
D Adamson, A Deligkas, VV Gusev, I Potapov
47th International Symposium on Mathematical Foundations of Computer Science …, 2022
Các cơ quan ủy nhiệm: Icelandic Centre for Research
Approximating the existential theory of the reals
A Deligkas, J Fearnley, T Melissourgos, PG Spirakis
International Conference on Web and Internet Economics, 126-139, 2018
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Pure-circuit: Tight inapproximability for PPAD
A Deligkas, J Fearnley, A Hollender, T Melissourgos
Journal of the ACM 71 (5), 1-48, 2024
Các cơ quan ủy nhiệm: UK Engineering and Physical Sciences Research Council
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ