Publications

^* Equal contribution. [αβ] Authors listed in alphabetical order.

The Complexity of Computing Coarse Correlated Equilibria in Markov Games with a Single Controller
G. Farina, A. Kontogiannis, I. Panageas and V. Pollatos. [αβ]
arXiv preprint (2026). [paper]

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
A. Barakat, A. Kontogiannis, V. Pollatos, I. Panageas and A. Varvitsiotis.
arXiv preprint (2026). [paper]

The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
A. Kontogiannis, I. Panageas and V. Pollatos. [αβ]
arXiv preprint (2026). [paper]

Efficient Swap Regret Minimization in Combinatorial Bandits
A. Kontogiannis^*, V. Pollatos^*, P. Mertikopoulos and I. Panageas.
AISTATS 2026. [paper]

Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
A. Kontogiannis^*, V. Pollatos^*, G. Farina, P. Mertikopoulos and I. Panageas.
NeurIPS 2025. [paper]

On Corruption-Robustness in Performative Reinforcement Learning
V. Pollatos, D. Mandal and G. Radanovic.
AAAI 2025, oral presentation. [paper]

The Computational Complexity of Finding Second-Order Stationary Points
A. Kontogiannis^*, V. Pollatos^*, S. Kanellopoulos, P. Mertikopoulos, A. Pagourtzis and I. Panageas.
ICML 2024. [paper]

Tree-based Focused Web Crawling with Reinforcement Learning
A. Kontogiannis, D. Kelesis, V. Pollatos, G. Paliouras and G. Giannakopoulos.
arXiv preprint (2021). [paper]

Land Cover Semantic Segmentation Using ResUNet
V. Pollatos, L. Kouvaras and E. Charou.
AINST 2020. [paper]

Master Thesis

Learning Mixtures of Selective Mallows Models
V. Pollatos.
M.Eng. Diploma Thesis, National Technical University of Athens, 2022. Advisor: Dimitris Fotakis. [thesis]