Dr Themistoklis Melissourgos
-
Email
themistoklis.melissourgos@essex.ac.uk -
Location
5A.544, Colchester Campus
-
Academic support hours
Thursdays 14:00-16: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
Conferences and presentations
ICALP Workshop: Recent Advances on Total Search Problems
Invited presentation, 4/7/2022
Teaching and supervision
Current teaching responsibilities
-
Team Project Challenge (CE101)
-
Quantitative Methods in Finance and Trading (CF962)
-
Financial Engineering and Risk Management (CF966)
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 (5)
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
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: Web and Internet Economics. 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: LATIN 2018: Theoretical Informatics. 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: Algorithmic Game Theory. Springer International Publishing. 245- 250. 9783319996592
Christodoulou, G., Melissourgos, T. and Spirakis, PG., (2018). Strategic Contention Resolution in Multiple Channels. In: Approximation and Online Algorithms. 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 (13)
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
Deligkas, A., Fearnley, J., Hollender, A. and Melissourgos, T., Tight Inapproximability for Graphical Games
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:
Thursdays 14:00-16:00
Follow me on social media