Obserwuj
Marios Mavronicolas
Marios Mavronicolas
Professor of Computer Science, University of Cyprus
Zweryfikowany adres z cs.ucy.ac.cy
Tytuł
Cytowane przez
Cytowane przez
Rok
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
3022002
The price of selfish routing
M Mavronicolas, P Spirakis
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
2522001
Approximate equilibria and ball fusion
E Koutsoupias, M Mavronicolas, P Spirakis
Theory of Computing Systems 36 (6), 683-693, 2003
1652003
Computing Nash equilibria for scheduling on restricted parallel links
M Gairing, T Lücking, M Mavronicolas, B Monien
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
1512004
A new model for selfish routing
T Lücking, M Mavronicolas, B Monien, M Rode
STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004
141*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
1172013
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
842009
Congestion games with player-specific constants
M Mavronicolas, I Milchtaich, B Monien, K Tiemann
Mathematical Foundations of Computer Science 2007: 32nd International …, 2007
832007
Extreme nash equilibria
M Gairing, T Lücking, M Mavronicolas, B Monien, P Spirakis
Italian Conference on Theoretical Computer Science, 1-20, 2003
79*2003
Nash equilibria in discrete routing games with convex latency functions
M Gairing, T Lücking, M Mavronicolas, B Monien, M Rode
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
742004
Which is the worst-case Nash equilibrium?
T Lücking, M Mavronicolas, B Monien, M Rode, P Spirakis, I Vrto
Mathematical Foundations of Computer Science 2003: 28th International …, 2003
712003
The price of selfish routing
M Mavronicolas, P Spirakis
Algorithmica 48, 91-126, 2007
652007
Voronoi games on cycle graphs
M Mavronicolas, B Monien, VG Papadopoulou, F Schoppmann
International Symposium on Mathematical Foundations of Computer Science, 503-514, 2008
622008
A combinatorial treatment of balancing networks
C Busch, M Mavronicolas
Journal of the ACM (JACM) 43 (5), 794-839, 1996
581996
A comparative study of protocols for efficient data propagation in smart dust networks
I Chatzigiannakis, T Dimitriou, M Mavronicolas, S Nikoletseas, P Spirakis
Euro-Par 2003 Parallel Processing: 9th International Euro-Par Conference …, 2003
542003
∃ ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games
V Bilò, M Mavronicolas
ACM Transactions on Economics and Computation (TEAC) 9 (3), 1-25, 2021
402021
A catalog of EXISTS-R-complete decision problems about Nash equilibria in multi-player games
V Bilò, M Mavronicolas
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016
402016
A graph-theoretic network security game
M Mavronicolas, V Papadopoulou, A Philippou, P Spirakis
International Workshop on Internet and Network Economics, 969-978, 2005
392005
A network game with attackers and a defender
M Mavronicolas, V Papadopoulou, A Philippou, P Spirakis
Algorithmica 51, 315-341, 2008
382008
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
382006
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20