Items where Author is "Deligkas, Argyrios"

Article

Deligkas, Argyrios and Fearnley, John and Melissourgos, Themistoklis (2025) Pizza Sharing is PPA-hard. ACM Transactions on Computation Theory. (In Press)

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2025) Constant Inapproximability for PPA. SIAM Journal on Computing, 54 (1). pp. 163-192. DOI https://doi.org/10.1137/22M1536613

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2024) Pure-Circuit: Tight Inapproximability for PPAD. Journal of the ACM, 71 (5). pp. 1-48. DOI https://doi.org/10.1145/3678166 (In Press)

Deligkas, Argyrios and Filos-Ratsikas, Aris and Voudouris, Alexandros (2024) Truthful interval covering. Autonomous Agents and Multi-Agent Systems, 38. p. 41. DOI https://doi.org/10.1007/s10458-024-09673-6

Deligkas, Argyrios and Filos-Ratsikas, Aris and Voudouris, Alexandros (2023) Heterogeneous facility location with limited resources. Games and Economic Behavior, 139. pp. 200-215. DOI https://doi.org/10.1016/j.geb.2023.03.001

Deligkas, Argyrios and Fearnley, John and Melissourgos, Themistoklis and Spirakis, Paul G (2022) Approximating the existential theory of the reals. Journal of Computer and System Sciences, 125. pp. 106-128. DOI https://doi.org/10.1016/j.jcss.2021.11.002

Akrida, Eleni and Deligkas, Argyrios and Melissourgos, Themistoklis and Spirakis, Paul (2021) Connected Subgraph Defense Games. Algorithmica, 83 (11). pp. 3403-3431. DOI https://doi.org/10.1007/s00453-021-00858-z

Monograph

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Pure-Circuit: Strong Inapproximability for PPAD. Working Paper. arXiv. (Unpublished)

Conference or Workshop Item

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2024) Constant Inapproximability for Fisher Markets. In: Twenty-Fifth ACM Conference on Economics and Computation (EC'24), 2024-07-08 - 2024-07-11, Yale University, New Haven, CT, USA.

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2023) Tight Inapproximability for Graphical Games. In: 37th AAAI Conference on Artificial Intelligence, 2023-02-07 - 2023-02-14, Washington DC, USA.

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Pure-Circuit: Strong Inapproximability for PPAD. In: FOCS 2022: 63rd IEEE Symposium on Foundations of Computer Science, 2022-10-31 - 2022-11-03, Denver, Colorado.

Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2022) Constant Inapproximability for PPA. In: STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022-06-20 - 2022-06-24, Rome, Italy.