Items where Author is "Melissourgos, Themistoklis"

Article

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 Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2024) Constant Inapproximability for PPA. SIAM Journal on Computing. (In Press)

Kampouridis, Michael and Kanellopoulos, Panagiotis and Kyropoulou, Maria and Melissourgos, Themistoklis and Voudouris, Alexandros (2022) Multi-Agent Systems for Computational Economics and Finance. AI Communications: the European journal on artificial intelligence, 35 (4). pp. 369-380. DOI https://doi.org/10.3233/aic-220117

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

Melissourgos, Themistoklis and Nikoletseas, Sotiris E and Raptopoulos, Christoforos L and Spirakis, Paul G (2022) An extension of the Moran process using type-specific connection graphs. Journal of Computer and System Sciences, 124. pp. 77-96. DOI https://doi.org/10.1016/j.jcss.2021.07.007

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

Giannakopoulos, Yiannis and Grosz, Alexander and Melissourgos, Themistoklis (2024) On the Smoothed Complexity of Combinatorial Local Search. In: The 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP), 2024-07-08 - 2024-07-12, Tallinn, Estonia.

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. (In Press)

Salman, Ozgur and Melissourgos, Themistoklis and Kampouridis, Michail (2023) Optimization of Trading Strategies using a Genetic Algorithm under the Directional Changes Paradigm with Multiple Thresholds. In: IEEE Congress on Evolutionary Computation (CEC), 2023-07-01 - 2023-07-05, Chicago, USA. (In Press)

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.