Marios Mavronicolas
Marios Mavronicolas
Professor of Computer Science, University of Cyprus
Verified email at cs.ucy.ac.cy
Title
Cited by
Cited by
Year
The structure and complexity of Nash equilibria for a selfish routing game
D Fotakis, S Kontogiannis, E Koutsoupias, M Mavronicolas, P Spirakis
International Colloquium on Automata, Languages, and Programming, 123-134, 2002
2722002
The price of selfish routing
M Mavronicolas, P Spirakis
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
2362001
Computing Nash equilibria for scheduling on restricted parallel links
M Gairing, T Lücking, M Mavronicolas, B Monien
Theory of Computing Systems 47 (2), 405-432, 2010
1592010
Approximate equilibria and ball fusion
E Koutsoupias, M Mavronicolas, P Spirakis
Theory of Computing Systems 36 (6), 683-693, 2003
1502003
A new model for selfish routing
T Lücking, M Mavronicolas, B Monien, M Rode
Annual Symposium on Theoretical Aspects of Computer Science, 547-558, 2004
130*2004
A distributed algorithm for gathering many fat mobile robots in the plane
C Agathangelou, C Georgiou, M Mavronicolas
Proceedings of the 2013 ACM symposium on Principles of distributed computing …, 2013
832013
Congestion games with player-specific constants
M Mavronicolas, I Milchtaich, B Monien, K Tiemann
International Symposium on Mathematical Foundations of Computer Science, 633-644, 2007
722007
Extreme nash equilibria
M Gairing, T Lücking, M Mavronicolas, B Monien, P Spirakis
Italian Conference on Theoretical Computer Science, 1-20, 2003
72*2003
Nash equilibria in discrete routing games with convex latency functions
M Gairing, T Lücking, M Mavronicolas, B Monien, M Rode
International Colloquium on Automata, Languages, and Programming, 645-657, 2004
682004
The structure and complexity of Nash equilibria for a selfish routing game
D Fotakis, S Kontogiannis, E Koutsoupias, M Mavronicolas, P Spirakis
Theoretical Computer Science 410 (36), 3305-3326, 2009
642009
Which is the worst-case Nash equilibrium?
T Lücking, M Mavronicolas, B Monien, M Rode, P Spirakis, I Vrto
International Symposium on Mathematical Foundations of Computer Science, 551-561, 2003
632003
The price of selfish routing
M Mavronicolas, P Spirakis
Algorithmica 48 (1), 91-126, 2007
602007
A combinatorial treatment of balancing networks
C Busch, M Mavronicolas
Journal of the ACM (JACM) 43 (5), 794-839, 1996
591996
A comparative study of protocols for efficient data propagation in smart dust networks
I Chatzigiannakis, T Dimitriou, M Mavronicolas, S Nikoletseas, P Spirakis
Parallel Processing Letters 13 (04), 615-627, 2003
522003
Voronoi games on cycle graphs
M Mavronicolas, B Monien, VG Papadopoulou, F Schoppmann
International Symposium on Mathematical Foundations of Computer Science, 503-514, 2008
472008
A network game with attackers and a defender
M Mavronicolas, V Papadopoulou, A Philippou, P Spirakis
Algorithmica 51 (3), 315-341, 2008
382008
A graph-theoretic network security game
M Mavronicolas, V Papadopoulou, A Philippou, P Spirakis
International Workshop on Internet and Network Economics, 969-978, 2005
382005
The price of anarchy for polynomial social cost
M Gairing, T Lücking, M Mavronicolas, B Monien
International Symposium on Mathematical Foundations of Computer Science, 574-585, 2004
362004
The price of anarchy for restricted parallel links
M Gairing, T Lücking, M Mavronicolas, B Monien
Parallel Processing Letters 16 (01), 117-131, 2006
342006
On the stability of compositions of universally stable, greedy contention-resolution protocols
D Koukopoulos, M Mavronicolas, S Nikoletseas, P Spirakis
International Symposium on Distributed Computing, 88-102, 2002
342002
The system can't perform the operation now. Try again later.
Articles 1–20