Scholar
Themistoklis Melissourgos
Google Scholar ID: t1KpSQoAAAAJ
University of Essex
Citations & Impact
Citations
154
H-index
7
i10-index
6
Publications
20
Co-authors
12
list available
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- Publications include:
- - Constant Inapproximability for Fisher Markets (EC 2024)
- - On the Smoothed Complexity of Combinatorial Local Search (ICALP 2024)
- - Optimization of Trading Strategies Using a Genetic Algorithm Under the Directional Changes Paradigm with Multiple Thresholds (CEC 2023)
- - Tight Inapproximability for Graphical Games (AAAI 2023)
- - Pure-Circuit: Strong Inapproximability for PPAD (FOCS 2022)
- - Constant Inapproximability for PPA (STOC 2022)
- - Pizza Sharing is PPA-hard (AAAI 2022)
- - Walrasian Equilibria in Markets with Small Demands (AAMAS 2021)
- - Connected Subgraph Defense Games (SAGT 2019)
- - Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (ICALP 2019)
- - Approximating the Existential Theory of the Reals (WINE 2018)
- - Strategic Contention Resolution in Multiple Channels (WAOA 2018)
Research Experience
- - Lecturer (Assistant Professor): School of Computer Science and Electronic Engineering, University of Essex
- - Member: Artificial Intelligence group and Centre for Computational Finance and Economic Agents
- - Post-doctoral researcher: Operations Research group at TU Munich, headed by Prof. Andreas S. Schulz
- - Short-term post-doctoral researcher: Department of Computer Science, University of Liverpool
Education
- - PhD: Department of Computer Science, University of Liverpool, supervised by Prof. Paul Spirakis
- - Bachelor's degree: Electrical and Computer Engineering, University of Patras
Background
- Research interests mainly revolve around Algorithmic Game Theory. Also enjoys working in Computational Social Choice and the intersection of Theoretical Computer Science and Economics.
