Marios Mavronicolas

ORCID

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 21

Top Venues

Publications

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto
Which is the Worst-Case Nash Equilibrium? SIAM J. Discret. Math. 38 (2) (2024)
Marios Mavronicolas, Paul G. Spirakis
The Contest Game for Crowdsourcing Reviews. SAGT (2023)
Marios Mavronicolas, Paul G. Spirakis
The Contest Game for Crowdsourcing Reviews. CoRR (2023)
Vittorio Bilò, Kristoffer Arnsfelt Hansen, Marios Mavronicolas
Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games. SAGT (2023)
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions. Theory Comput. Syst. 66 (5) (2022)
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values. Theor. Comput. Sci. 860 (2021)
Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis
The Price of Defense. Algorithmica 83 (5) (2021)
Vittorio Bilò, Marios Mavronicolas
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games. Algorithmica 83 (2) (2021)
Vittorio Bilò, Marios Mavronicolas
∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games. ACM Trans. Economics and Comput. 9 (3) (2021)
Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien
(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations. CoRR (2020)
Marios Mavronicolas, Burkhard Monien
Conditional Value-at-Risk: Structure and complexity of equilibria. Theor. Comput. Sci. 807 (2020)
Vittorio Bilò, Marios Mavronicolas
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games. CoRR (2019)
Marios Mavronicolas, Burkhard Monien
NP -Hardness of Equilibria in Case of Risk-Averse Players. Adventures Between Lower Bounds and Higher Altitudes (2018)
Marios Mavronicolas, Burkhard Monien
Conditional Value-at-Risk: Structure and Complexity of Equilibria. SAGT (2017)
Vittorio Bilò, Marios Mavronicolas
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. STACS (2017)
Marios Mavronicolas, Burkhard Monien
The complexity of equilibria for risk-modeling valuations. Theor. Comput. Sci. 634 (2016)
Vittorio Bilò, Marios Mavronicolas
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. STACS (2016)
Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
Weighted Boolean Formula Games. Algorithms, Probability, Networks, and Games (2015)
Marios Mavronicolas, Burkhard Monien
The complexity of pure equilibria in mix-weighted congestion games on parallel links. Inf. Process. Lett. 115 (12) (2015)
Marios Mavronicolas, Burkhard Monien
The Complexity of Equilibria for Risk-Modeling Valuations. CoRR (2015)
Marios Mavronicolas, Burkhard Monien
Minimizing Expectation Plus Variance. Theory Comput. Syst. 57 (3) (2015)
Vittorio Bilò, Marios Mavronicolas
Complexity of Rational and Irrational Nash Equilibria. Theory Comput. Syst. 54 (3) (2014)
Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas
A distributed algorithm for gathering many fat mobile robots in the plane. PODC (2013)
Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta
How many attackers can selfish defenders catch? Discret. Appl. Math. 161 (16-17) (2013)
Andrzej Goscinski, Marios Mavronicolas, Weisong Shi, Yong Meng Teo
Topic 8: Distributed Systems and Algorithms. Euro-Par (2012)
Marios Mavronicolas, Burkhard Monien
Minimizing Expectation Plus Variance. SAGT (2012)
Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas
A Distributed Algorithm for Gathering Many Fat Mobile Robots in the Plane CoRR (2012)
Vittorio Bilò, Marios Mavronicolas
The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games. SAGT (2012)
Marios Mavronicolas
Preface: Algorithmic Game Theory. Theory Comput. Syst. 49 (1) (2011)
Vittorio Bilò, Marios Mavronicolas
Complexity of Rational and Irrational Nash Equilibria. SAGT (2011)
Marios Mavronicolas, Thomas Sauerwald
The impact of randomization in smoothing networks. Distributed Comput. 22 (5-6) (2010)
Marios Mavronicolas
Some Algorithmic Questions About Nash Equilibria. Bull. EATCS 100 (2010)
Rainer Feldmann, Marios Mavronicolas, Andreas Pieris
Facets of the Fully Mixed Nash Equilibrium Conjecture. Theory Comput. Syst. 47 (1) (2010)
Costas Busch, Marios Mavronicolas
An efficient counting network. Theor. Comput. Sci. 411 (34-36) (2010)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. 47 (2) (2010)
Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis
Preface. Theor. Comput. Sci. 410 (17) (2009)
Marios Mavronicolas
Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer). SIGACT News 40 (2) (2009)
Marios Mavronicolas, Loizos Michael
A substitution theorem for graceful trees and its applications. Discret. Math. 309 (12) (2009)
Rainer Feldmann, Marios Mavronicolas, Burkhard Monien
Nash Equilibria for Voronoi Games on Transitive Graphs. WINE (2009)
Marios Mavronicolas, Loizos Michael, Paul G. Spirakis
Computing on a partially eponymous ring. Theor. Comput. Sci. 410 (6-7) (2009)
Marios Mavronicolas, Thomas Sauerwald
A randomized, o(log w)-depth 2 smoothing network. SPAA (2009)
Marios Mavronicolas
Preface. Theor. Comput. Sci. 410 (36) (2009)
Marios Mavronicolas, Paul G. Spirakis
A glimpse at Christos H. Papadimitriou. Comput. Sci. Rev. 3 (2) (2009)
Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis
The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410 (36) (2009)
Rainer Feldmann, Marios Mavronicolas, Andreas Pieris
Facets of the Fully Mixed Nash Equilibrium Conjecture. SAGT (2008)
Marios Mavronicolas, Thomas Sauerwald
The impact of randomization in smoothing networks. PODC (2008)
Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
A graph-theoretic network security game. Int. J. Auton. Adapt. Commun. Syst. 1 (4) (2008)
Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis
A Network Game with Attackers and a Defender. Algorithmica 51 (3) (2008)
Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou
How Many Attackers Can Selfish Defenders Catch? HICSS (2008)
Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou
How Many Attackers Can Selfish Defenders Catch? CoRR (2008)
Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld
Sequentially consistent versus linearizable counting networks. Distributed Comput. 21 (4) (2008)
Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann
Voronoi Games on Cycle Graphs. MFCS (2008)
Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Algorithmica 52 (1) (2008)
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
A new model for selfish routing. Theor. Comput. Sci. 406 (3) (2008)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
Nash equilibria in discrete routing games with convex latency functions. J. Comput. Syst. Sci. 74 (7) (2008)
Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann
Congestion Games with Player-Specific Constants. MFCS (2007)
Marios Mavronicolas, Paul G. Spirakis
The Price of Selfish Routing. Algorithmica 48 (1) (2007)
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
Performance and stability bounds for dynamic networks. J. Parallel Distributed Comput. 67 (4) (2007)
Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner
Weighted Boolean Formula Games. WINE (2007)
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
Efficient bufferless packet switching on trees and leveled networks. J. Parallel Distributed Comput. 67 (11) (2007)
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
The increase of the instability of networks due to Quasi-Static link capacities. Theor. Comput. Sci. 381 (1-3) (2007)
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
Universal Bufferless Packet Switching. SIAM J. Comput. 37 (4) (2007)
Marios Mavronicolas, Loizos Michael, Paul G. Spirakis
Computing on a Partially Eponymous Ring. OPODIS (2006)
Marina Gelastou, Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
The Power of the Defender. ICDCS Workshops (2006)
Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis
The Price of Defense and Fractional Matchings. ICDCN (2006)
Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
The Price of Defense. MFCS (2006)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett. 16 (1) (2006)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369 (1-3) (2006)
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis
Direct Routing: Algorithms and Complexity. Algorithmica 45 (1) (2006)
Costas Busch, Marios Mavronicolas, Paul G. Spirakis
An Application of the Monotone Linearizability Lemma. Bull. EATCS 85 (2005)
Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
A Cost Mechanism for Fair Pricing of Resource Usage. Algorithmic Aspects of Large and Complex Networks (2005)
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. SIAM J. Comput. 34 (5) (2005)
Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
A Graph-Theoretic Network Security Game. WINE (2005)
Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
A Cost Mechanism for Fair Pricing of Resource Usage. WINE (2005)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
Structure and complexity of extreme Nash equilibria. Theor. Comput. Sci. 343 (1-2) (2005)
Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
The Impact of Network Structure on the Stability of Greedy Protocols. Theory Comput. Syst. 38 (4) (2005)
Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE (2005)
Costas Busch, Marios Mavronicolas, Paul G. Spirakis
The cost of concurrent, low-contention Read&Modify&Write. Theor. Comput. Sci. 333 (3) (2005)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
The Price of Anarchy for Polynomial Social Cost. Computing and Markets (2005)
Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis
Network Game with Attacker and Protector Entities. ISAAC (2005)
Samson Abramsky, Marios Mavronicolas
Game Theory Meets Theoretical Computer Science. Theor. Comput. Sci. 343 (1-2) (2005)
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Max-min Fair Flow Control Sensitive to Priorities. J. Interconnect. Networks 6 (2) (2005)
Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis
Cost Sharing Mechanisms for Fair Pricing of Resources Usage. Algorithmic Aspects of Large and Complex Networks (2005)
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
Performance and Stability Bounds for Dynamic Networks. ISPAN (2004)
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer
Near-Optimal Hot-Potato Routing on Trees. Euro-Par (2004)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
Computing Nash equilibria for scheduling on restricted parallel links. STOC (2004)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP (2004)
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis
Direct Routing: Algorithms and Complexity. ESA (2004)
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
A New Model for Selfish Routing. STACS (2004)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
The Price of Anarchy for Polynomial Social Cost. MFCS (2004)
Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
Universal Bufferless Routing. WAOA (2004)
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
Instability of Networks with Quasi-Static Link Capacities. SIROCCO (2003)
Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto
Which Is the Worst-Case Nash Equilibrium? MFCS (2003)
Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis
FIFO is Unstable at Arbitrarily Low Rates Electron. Colloquium Comput. Complex. 10 (016) (2003)
Marios Mavronicolas, Nikos Papadakis
Trade-off results for connection management. Theor. Comput. Sci. 290 (1) (2003)
Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks. Euro-Par (2003)
Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
The Impact of Network Structure on the Stability of Greedy Protocols. CIAC (2003)
Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis
Extreme Nash Equilibria. ICTCS (2003)
Costas Busch, Marios Mavronicolas, Paul G. Spirakis
The Cost of Concurrent, Low-Contention Read-Modify-Write. SIROCCO (2003)
Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis
A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks. Parallel Process. Lett. 13 (4) (2003)

Marios Mavronicolas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Marios Mavronicolas