Marios Mavronicolas

According to our database, Marios Mavronicolas authored at least 112 papers between 1992 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Mixed Nash Equilibria in Discrete Tullock Contests.

Vittorio Bilò, Marios Mavronicolas, Paul G. Spirakis, Daniel Windisch

Proceedings of the Algorithmic Game Theory - 18th International Symposium, 2025

2024

Which is the Worst-Case Nash Equilibrium?

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis, Imrich Vrto

SIAM J. Discret. Math., 2024

2023

The Contest Game for Crowdsourcing Reviews.

Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games.

Vittorio Bilò, Kristoffer Arnsfelt Hansen, Marios Mavronicolas

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

2022

(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions.

Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien

Theory Comput. Syst., 2022

2021

∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games.

Vittorio Bilò, Marios Mavronicolas

ACM Trans. Economics and Comput., 2021

The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values.

Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien

Theor. Comput. Sci., 2021

The Price of Defense.

Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis

Algorithmica, 2021

The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games.

Vittorio Bilò, Marios Mavronicolas

Algorithmica, 2021

2020

(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations.

Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien

CoRR, 2020

2018

<i>NP</i> NP -Hardness of Equilibria in Case of Risk-Averse Players.

Marios Mavronicolas, Burkhard Monien

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games.

Vittorio Bilò, Marios Mavronicolas

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Conditional Value-at-Risk: Structure and Complexity of Equilibria.

Marios Mavronicolas, Burkhard Monien

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016

The complexity of equilibria for risk-modeling valuations.

Marios Mavronicolas, Burkhard Monien

Theor. Comput. Sci., 2016

A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.

Vittorio Bilò, Marios Mavronicolas

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

The complexity of pure equilibria in mix-weighted congestion games on parallel links.

Marios Mavronicolas, Burkhard Monien

Inf. Process. Lett., 2015

2013

A distributed algorithm for gathering many fat mobile robots in the plane.

Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Minimizing Expectation Plus Variance.

Marios Mavronicolas, Burkhard Monien

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games.

Vittorio Bilò, Marios Mavronicolas

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Topic 8: Distributed Systems and Algorithms.

Andrzej Goscinski, Marios Mavronicolas, Weisong Shi, Yong Meng Teo

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011

Preface: Algorithmic Game Theory.

Marios Mavronicolas

Theory Comput. Syst., 2011

Complexity of Rational and Irrational Nash Equilibria.

Vittorio Bilò, Marios Mavronicolas

Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010

Some Algorithmic Questions About Nash Equilibria.

Marios Mavronicolas

Bull. EATCS, 2010

2009

Preface.

Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis

Theor. Comput. Sci., 2009

Preface.

Marios Mavronicolas

Theor. Comput. Sci., 2009

Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer).

Marios Mavronicolas

SIGACT News, 2009

A substitution theorem for graceful trees and its applications.

Marios Mavronicolas, Loizos Michael

Discret. Math., 2009

A glimpse at Christos H. Papadimitriou.

Marios Mavronicolas, Paul G. Spirakis

Comput. Sci. Rev., 2009

Nash Equilibria for Voronoi Games on Transitive Graphs.

Rainer Feldmann, Marios Mavronicolas, Burkhard Monien

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

A randomized, o(log w)-depth 2 smoothing network.

Marios Mavronicolas, Thomas Sauerwald

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008

Cost Sharing Mechanisms for Fair Pricing of Resource Usage.

Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis

Algorithmica, 2008

A Network Game with Attackers and a Defender.

Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis

Algorithmica, 2008

Facets of the Fully Mixed Nash Equilibrium Conjecture.

Rainer Feldmann, Marios Mavronicolas, Andreas Pieris

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

The impact of randomization in smoothing networks.

Marios Mavronicolas, Thomas Sauerwald

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Voronoi Games on Cycle Graphs.

Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

How Many Attackers Can Selfish Defenders Catch?

Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

2007

The increase of the instability of networks due to Quasi-Static link capacities.

Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis

Theor. Comput. Sci., 2007

Universal Bufferless Packet Switching.

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas

SIAM J. Comput., 2007

Efficient bufferless packet switching on trees and leveled networks.

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas

J. Parallel Distributed Comput., 2007

Weighted Boolean Formula Games.

Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Congestion Games with Player-Specific Constants.

Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

The Price of Anarchy for Restricted Parallel Links.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Parallel Process. Lett., 2006

Computing on a Partially Eponymous Ring.

Marios Mavronicolas, Loizos Michael, Paul G. Spirakis

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

The Price of Defense.

Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

The Power of the Defender.

Marina Gelastou, Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis

Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS 2006 Workshops), 2006

The Price of Defense and Fractional Matchings.

Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005

Structure and complexity of extreme Nash equilibria.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis

Theor. Comput. Sci., 2005

Game Theory Meets Theoretical Computer Science.

Samson Abramsky, Marios Mavronicolas

Theor. Comput. Sci., 2005

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control.

Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis

SIAM J. Comput., 2005

Max-min Fair Flow Control Sensitive to Priorities.

Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis

J. Interconnect. Networks, 2005

An Application of the Monotone Linearizability Lemma.

Costas Busch, Marios Mavronicolas, Paul G. Spirakis

Bull. EATCS, 2005

A Graph-Theoretic Network Security Game.

Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis

Proceedings of the Internet and Network Economics, First International Workshop, 2005

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.

Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Network Game with Attacker and Protector Entities.

Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Cost Sharing Mechanisms for Fair Pricing of Resources Usage.

Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis

Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

A Cost Mechanism for Fair Pricing of Resource Usage.

Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis

Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

2004

Universal Bufferless Routing.

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Computing Nash equilibria for scheduling on restricted parallel links.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

A New Model for Selfish Routing.

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode

Proceedings of the STACS 2004, 2004

The Price of Anarchy for Polynomial Social Cost.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Performance and Stability Bounds for Dynamic Networks.

Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Nash Equilibria in Discrete Routing Games with Convex Latency Functions.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Near-Optimal Hot-Potato Routing on Trees.

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer

Proceedings of the Euro-Par 2004 Parallel Processing, 2004

Direct Routing: Algorithms and Complexity.

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Algorithms, 2004

2003

FIFO is Unstable at Arbitrarily Low Rates

Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis

Electron. Colloquium Comput. Complex., 2003

Instability of Networks with Quasi-Static Link Capacities.

Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

The Cost of Concurrent, Low-Contention Read-Modify-Write.

Costas Busch, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Which Is the Worst-Case Nash Equilibrium?

Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Extreme Nash Equilibria.

Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks.

Ioannis Chatzigiannakis, Tassos Dimitriou, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis

Proceedings of the Euro-Par 2003. Parallel Processing, 2003

The Impact of Network Structure on the Stability of Greedy Protocols.

Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

Review of Introduction to Distributed Algorithms.

Marios Mavronicolas

SIGACT News, 2002

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols.

Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis

Proceedings of the Distributed Computing, 16th International Conference, 2002

Approximate Equilibria and Ball Fusion.

Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the SIROCCO 9, 2002

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.

Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Distributed Systems and Algorithms.

Marios Mavronicolas, André Schiper

Proceedings of the Euro-Par 2002, 2002

2001

The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example).

Marios Mavronicolas

Bull. EATCS, 2001

Stability in Routing: Networks and Protocols.

Marios Mavronicolas

Bull. EATCS, 2001

The price of selfish routing.

Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

Annotated Bibliography on Counting Networks.

Marios Mavronicolas

Bull. EATCS, 2000

A Combinatorial Characterization of Properties Preserved by Antitokens.

Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999

Linearizable Read/Write Objects.

Marios Mavronicolas, Dan Roth

Theor. Comput. Sci., 1999

Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions.

Maria Eleftheriou, Marios Mavronicolas

Proceedings of the Distributed Computing, 1999

Supporting Increment and Decrement Operations in Balancing Networks.

William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou

Proceedings of the STACS 99, 1999

Threshold Counters with Increments and Decrements.

Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas

Proceedings of the SIROCCO'99, 1999

Optimal, Distributed Decision-Making: The Case of no Communication.

Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Sequentially Consistent versus Linearizable Counting Networks.

Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Optimal, Distributed Decision-Making: The Case of No Communication.

Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

Contention in Balancing Networks Resolved (Extended Abstract).

Leonidas Hadjimitsis, Marios Mavronicolas

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.

Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

MaxMin Fair Flow Control Sensitive to Priorities.

Pimitris Fatourou, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Distributed Computing, 1998

An Efficient Counting Network.

Costas Busch, Marios Mavronicolas

Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

1997

Balancing Networks: State of the Art.

Marios Mavronicolas

Inf. Sci., 1997

Impossibility Results for Weak Threshold Networks.

Costas Busch, Marios Mavronicolas

Inf. Process. Lett., 1997

Advances in Rate-Based Flow Control.

Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the SIROCCO'97, 1997

Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract).

Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

The Impact of Timing on Linearizability in Counting Networks.

Marios Mavronicolas, Marina Papatriantafilou, Philippas Tsigas

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Trade-Off Results for Connection Management.

Marios Mavronicolas, Nikos Papadakis

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Timing-based connection management.

Marios Mavronicolas

Proceedings of the Networks in Distributed Computing, 1997

1996

Distributed, low contention task allocation.

Sarantos Kapidakis, Marios Mavronicolas

Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Wait-Free Solvability Via Combinatorial Topology (Abstract).

Marios Mavronicolas

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

The Strength of Counting Networks (Abstract).

Costas Busch, Marios Mavronicolas

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Load Balancing Networks (Abstract).

Sarantos Kapidakis, Marios Mavronicolas

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

A Logarithmic Depth Counting Network (Abstract).

Costas Busch, Marios Mavronicolas

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

1994

Efficiency of Semisynchronous Versus.

Hagit Attiya, Marios Mavronicolas

Math. Syst. Theory, 1994

The Impact of Synchronization on the Session Problem.

Marios Mavronicolas

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

A Combinatorial Treatment of Balancing Networks.

Costas Busch, Marios Mavronicolas

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Contention in Counting Networks.

Costas Busch, Nikos Hardavellas, Marios Mavronicolas

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Proving Correctness for Balancing Networks.

Costas Busch, Marios Mavronicolas

Proceedings of the Workshop on Parallel Processing of Discrete Optimization Problems, 1994

1993

Notes on Sorting and Counting Networks (Extended Abstract).

Nikos Hardavellas, Damianos G. Karakos, Marios Mavronicolas

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

1992

Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract).

Marios Mavronicolas, Dan Roth

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

An upper and a lower bound for tick synchronization.

Marios Mavronicolas

Proceedings of the Real-Time Systems Symposium, 1992