Scholar
Andreas Kontogiannis
Google Scholar ID: nBFso2IAAAAJ
PhD Candidate at NTUA & Archimedes AI
Game Theory
Multi-Agent Learning
Reinforcement Learning
Bandits
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
31
H-index
4
i10-index
1
Publications
8
Co-authors
15
list available
Publications
7 items
The Complexity of Computing Nash Equilibria in Colonel Blotto Games
2026
Cited
0
Finding a Positive Index Nash Equilibrium is PPADS-Complete
2026
Cited
0
The Complexity of Computing Coarse Correlated Equilibria in Markov Games with a Single Controller
2026
Cited
0
Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
2026
Cited
0
The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
2026
Cited
0
Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
2025
Cited
0
An Extended Benchmarking of Multi-Agent Reinforcement Learning Algorithms in Complex Fully Cooperative Tasks
2025
Cited
0
Co-authors
15 total
George Giannakopoulos
AI Researcher at NCSR Demokritos; CEO of SciFY Not-for-profit Company
George Vouros
Professor of AI, University of Piraeus
Vasilis Pollatos
Archimedes AI, NKUA
Georgios Paliouras
National Center for Scientific Research "Demokritos", Athens, Greece
Dimitrios Kelesis
National Center for Scientific Research "Demokritos", Athens, Greece
George Papadopoulos
PhD Candidate, University of Piraeus
Ioannis Koumentis
PhD candidate, University of Piraeus
Ioannis Panageas
Assistant Professor, University of California, Irvine
