Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. - Themistoklis Melissourgos; Paul G. Spirakis (CIAC, 2017)

Mutants and Residents with Different Connection Graphs in the Moran Process. - Themistoklis Melissourgos; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (LATIN, 2018)

Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. - George Christodoulou 001; Themistoklis Melissourgos; Paul G. Spirakis (SAGT, 2018)

Strategic Contention Resolution in Multiple Channels. - George Christodoulou 001; Themistoklis Melissourgos; Paul G. Spirakis (WAOA, 2018)

Algorithms and complexity of problems arising from strategic settings. - Themistoklis Melissourgos (2019)

Square-Cut Pizza Sharing is PPA-complete. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos (CoRR, 2020)

Walrasian Equilibria in Markets with Small Demands. - Argyrios Deligkas; Themistoklis Melissourgos; Paul G. Spirakis (AAMAS, 2021)

Connected Subgraph Defense Games. - Eleni C. Akrida; Argyrios Deligkas; Themistoklis Melissourgos; Paul G. Spirakis (Algorithmica, 2021)

Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis (J. Comput. Syst. Sci., 2021)

Pizza Sharing Is PPA-Hard. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos (AAAI, 2022)

Pure-Circuit: Strong Inapproximability for PPAD. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (FOCS, 2022)

Multi-agent systems for computational economics and finance. - Michael Kampouridis; Panagiotis Kanellopoulos; Maria Kyropoulou; Themistoklis Melissourgos; Alexandros A. Voudouris (AI Commun., 2022)

Approximating the existential theory of the reals. - Argyrios Deligkas; John Fearnley; Themistoklis Melissourgos; Paul G. Spirakis (J. Comput. Syst. Sci., 2022)

An extension of the Moran process using type-specific connection graphs. - Themistoklis Melissourgos; Sotiris E. Nikoletseas; Christoforos L. Raptopoulos; Paul G. Spirakis (J. Comput. Syst. Sci., 2022)

Tight Inapproximability for Graphical Games. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (AAAI, 2023)

Optimization of Trading Strategies Using a Genetic Algorithm Under the Directional Changes Paradigm with Multiple Thresholds. - Ozgur Salman; Themistoklis Melissourgos; Michael Kampouridis (CEC, 2023)

On the Smoothed Complexity of Combinatorial Local Search. - Yiannis Giannakopoulos; Alexander Grosz; Themistoklis Melissourgos (ICALP, 2024)

Constant Inapproximability for Fisher Markets. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (EC, 2024)

Pure-Circuit: Tight Inapproximability for PPAD. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (J. ACM, 2024)

Constant Inapproximability for PPA. - Argyrios Deligkas; John Fearnley; Alexandros Hollender; Themistoklis Melissourgos (SIAM J. Comput., 2025)

Online EFX Allocations with Predictions. - Themistoklis Melissourgos; Nicos Protopapas (CoRR, 2025)