Themistoklis Melissourgos

According to our database, Themistoklis Melissourgos authored at least 20 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Pure-Circuit: Tight Inapproximability for PPAD.

Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

J. ACM, October, 2024

Constant Inapproximability for Fisher Markets.

Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

On the Smoothed Complexity of Combinatorial Local Search.

Yiannis Giannakopoulos, Alexander Grosz, Themistoklis Melissourgos

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Optimization of Trading Strategies Using a Genetic Algorithm Under the Directional Changes Paradigm with Multiple Thresholds.

Ozgur Salman, Themistoklis Melissourgos, Michael Kampouridis

Proceedings of the IEEE Congress on Evolutionary Computation, 2023

Tight Inapproximability for Graphical Games.

Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

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

Approximating the existential theory of the reals.

Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos, Paul G. Spirakis

J. Comput. Syst. Sci., 2022

Multi-agent systems for computational economics and finance.

Michael Kampouridis, Panagiotis Kanellopoulos, Maria Kyropoulou, Themistoklis Melissourgos, Alexandros A. Voudouris

AI Commun., 2022

Constant inapproximability for PPA.

Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Pure-Circuit: Strong Inapproximability for PPAD.

Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Pizza Sharing Is PPA-Hard.

Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

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

Connected Subgraph Defense Games.

Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis

Algorithmica, 2021

Walrasian Equilibria in Markets with Small Demands.

Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Square-Cut Pizza Sharing is PPA-complete.

Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos

CoRR, 2020

2019

Algorithms and complexity of problems arising from strategic settings.

Themistoklis Melissourgos

PhD thesis, 2019

2018

Strategic Contention Resolution in Multiple Channels.

George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback.

George Christodoulou, Themistoklis Melissourgos, Paul G. Spirakis

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

Mutants and Residents with Different Connection Graphs in the Moran Process.

Themistoklis Melissourgos, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values.

Themistoklis Melissourgos, Paul G. Spirakis

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017