Dr Themistoklis Melissourgos
-
Email
themistoklis.melissourgos@essex.ac.uk -
Location
5A.544, Colchester Campus
-
Academic support hours
Autumn term: Mondays and Thursdays 16:00-17:00 Spring term: Thursdays 15:00-17:00
Profile
Biography
My research interests mainly revolve around Algorithmic Game Theory. I also enjoy working in Computational Social Choice and in the intersection of Theoretical Computer Science and Economics. I study the computational complexity and also exact/approximation algorithms of problems in these fields.
Research and professional activities
Research interests
Design and Analysis of Algorithms
Computational Complexity
Algorithmic Game Theory
Fair Division
Conferences and presentations
Constant Inapproximability for Fisher Markets
25th ACM Conference on Economics and Computation (EC 2024), 9/7/2024
Pizza Sharing is PPA-hard
Invited presentation, Automata, structures and verification seminar, Institut de Recherche en Informatique Fondamentale (IRIF), France, 12/6/2023
Constant Inapproximability for PPA
17th Athens Colloquium on Algorithms and Complexity (ACAC 2022), 26/8/2022
Constant Inapproximability for PPA
Invited presentation, ICALP Workshop: Recent Advances on Total Search Problems, 4/7/2022
Constant Inapproximability for PPA
54th Annual ACM Symposium on Theory of Computing (STOC 2022), 23/6/2022
Pizza Sharing is PPA-hard
36th AAAI Conference on Artificial Intelligence (AAAI 2022), 25/2/2022
Teaching and supervision
Current teaching responsibilities
-
Placement Year (CE300)
-
Quantitative Methods in Finance and Trading (CF962)
-
Computational Models in Economics and Finance (CF963)
Previous supervision
Degree subject: Computational Finance
Degree type: Doctor of Philosophy
Awarded date: 15/8/2024
Publications
Publications (2)
Deligkas, A., Fearnley, J., Hollender, A. and Melissourgos, T., (2022). Pure-Circuit: Strong Inapproximability for PPAD
Kampouridis, M., Kanellopoulos, P., Kyropoulou, M., Melissourgos, T. and Voudouris, AA., (2022). Multi-Agent Systems for Computational Economics and Finance
Journal articles (9)
Deligkas, A., Fearnley, J. and Melissourgos, T., Pizza Sharing is PPA-hard. ACM Transactions on Computation Theory
Deligkas, A., Fearnley, J., Hollender, A. and Melissourgos, T., (2025). Constant Inapproximability for PPA. SIAM Journal on Computing. 54 (1), 163-192
Deligkas, A., Fearnley, J., Hollender, A. and Melissourgos, T., (2024). Pure-Circuit: Tight Inapproximability for PPAD. Journal of the ACM. 71 (5), 1-48
Kampouridis, M., Kanellopoulos, P., Kyropoulou, M., Melissourgos, T. and Voudouris, A., (2022). Multi-Agent Systems for Computational Economics and Finance. AI Communications: the European journal on artificial intelligence. 35 (4), 369-380
Deligkas, A., Fearnley, J., Melissourgos, T. and Spirakis, PG., (2022). Approximating the existential theory of the reals. Journal of Computer and System Sciences. 125, 106-128
Melissourgos, T., Nikoletseas, SE., Raptopoulos, CL. and Spirakis, PG., (2022). An extension of the Moran process using type-specific connection graphs. Journal of Computer and System Sciences. 124, 77-96
Kampouridis, M., Kanellopoulos, P., Kyropoulou, M., Melissourgos, T. and Voudouris, AA., (2022). Multi-Agent Systems for Computational Economics and Finance.. CoRR. abs/2210.03540
Deligkas, A., Fearnley, J., Melissourgos, T. and Spirakis, PG., (2021). Computing exact solutions of consensus halving and the Borsuk-Ulam theorem. Journal of Computer and System Sciences. 117, 75-98
Akrida, E., Deligkas, A., Melissourgos, T. and Spirakis, P., (2021). Connected Subgraph Defense Games. Algorithmica. 83 (11), 3403-3431
Book chapters (5)
Deligkas, A., Fearnley, J., Melissourgos, T. and Spirakis, PG., (2018). Approximating the Existential Theory of the Reals. In: Lecture Notes in Computer Science. Springer International Publishing. 126- 139. 9783030046118
Melissourgos, T., Nikoletseas, S., Raptopoulos, C. and Spirakis, P., (2018). Mutants and Residents with Different Connection Graphs in the Moran Process. In: Lecture Notes in Computer Science. Springer International Publishing. 790- 804. 9783319774039
Christodoulou, G., Melissourgos, T. and Spirakis, PG., (2018). Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. In: Lecture Notes in Computer Science. Springer International Publishing. 245- 250. 9783319996592
Christodoulou, G., Melissourgos, T. and Spirakis, PG., (2018). Strategic Contention Resolution in Multiple Channels. In: Lecture Notes in Computer Science. Springer International Publishing. 165- 180. 9783030046927
Melissourgos, T. and Spirakis, P., (2017). Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values. In: Lecture Notes in Computer Science. Springer International Publishing. 418- 429. 9783319575858
Conferences (16)
Melissourgos, T. and Spirakis, P., Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values
Melissourgos, T., Nikoletseas, S., Raptopoulos, C. and Spirakis, P., Mutants and Residents with Different Connection Graphs in the Moran Process
Christodoulou, G., Melissourgos, T. and Spirakis, P., Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback
Christodoulou, G., Melissourgos, T. and Spirakis, P., Strategic Contention Resolution in Multiple Channels
Deligkas, A., Fearnley, J., Melissourgos, T. and Spirakis, P., Approximating the Existential Theory of the Reals
Deligkas, A., Fearnley, J., Melissourgos, T. and Spirakis, P., Approximating the Existential Theory of the Reals
Giannakopoulos, Y., Grosz, A. and Melissourgos, T., (2024). On the Smoothed Complexity of Combinatorial Local Search
Deligkas, A., Fearnley, J., Hollender, A. and Melissourgos, T., (2024). Constant Inapproximability for Fisher Markets
Deligkas, A., Fearnley, J., Hollender, A. and Melissourgos, T., (2023). Tight Inapproximability for Graphical Games
Salman, O., Melissourgos, T. and Kampouridis, M., (2023). Optimization of Trading Strategies using a Genetic Algorithm under the Directional Changes Paradigm with Multiple Thresholds
Deligkas, A., Fearnley, J. and Melissourgos, T., (2022). Pizza Sharing Is PPA-Hard
Deligkas, A., Fearnley, J., Hollender, A. and Melissourgos, T., (2022). Pure-Circuit: Strong Inapproximability for PPAD
Deligkas, A., Fearnley, J., Hollender, A. and Melissourgos, T., (2022). Constant Inapproximability for PPA
Deligkas, A., Melissourgos, T. and Spirakis, P., (2021). Walrasian Equilibria in Markets with Small Demands
Deligkas, A., Fearnley, J., Melissourgos, T. and Spirakis, P., (2019). Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem
Akrida, E., Deligkas, A., Melissourgos, T. and Spirakis, P., (2019). Connected Subgraph Defense Games
Contact
Academic support hours:
Autumn term: Mondays and Thursdays 16:00-17:00 Spring term: Thursdays 15:00-17:00
Follow me on social media
