Marios Mavronicolas

According to our database1, Marios Mavronicolas authored at least 132 papers between 1992 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games.
CoRR, 2019

2018
NP NP -Hardness of Equilibria in Case of Risk-Averse Players.
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.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Conditional Value-at-Risk: Structure and Complexity of Equilibria.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
The complexity of equilibria for risk-modeling valuations.
Theor. Comput. Sci., 2016

A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015
Minimizing Expectation Plus Variance.
Theory Comput. Syst., 2015

The complexity of pure equilibria in mix-weighted congestion games on parallel links.
Inf. Process. Lett., 2015

The Complexity of Equilibria for Risk-Modeling Valuations.
CoRR, 2015

2014
Complexity of Rational and Irrational Nash Equilibria.
Theory Comput. Syst., 2014

2013
How many attackers can selfish defenders catch?
Discrete Applied Mathematics, 2013

A distributed algorithm for gathering many fat mobile robots in the plane.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
A Distributed Algorithm for Gathering Many Fat Mobile Robots in the Plane
CoRR, 2012

Minimizing Expectation Plus Variance.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Topic 8: Distributed Systems and Algorithms.
Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011
Preface: Algorithmic Game Theory.
Theory Comput. Syst., 2011

Complexity of Rational and Irrational Nash Equilibria.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010
An efficient counting network.
Theor. Comput. Sci., 2010

Computing Nash Equilibria for Scheduling on Restricted Parallel Links.
Theory Comput. Syst., 2010

Facets of the Fully Mixed Nash Equilibrium Conjecture.
Theory Comput. Syst., 2010

Some Algorithmic Questions About Nash Equilibria.
Bulletin of the EATCS, 2010

The impact of randomization in smoothing networks.
Distributed Computing, 2010

2009
Preface.
Theor. Comput. Sci., 2009

Computing on a partially eponymous ring.
Theor. Comput. Sci., 2009

Preface.
Theor. Comput. Sci., 2009

The structure and complexity of Nash equilibria for a selfish routing game.
Theor. Comput. Sci., 2009

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

A substitution theorem for graceful trees and its applications.
Discrete Mathematics, 2009

A glimpse at Christos H. Papadimitriou.
Computer Science Review, 2009

Nash Equilibria for Voronoi Games on Transitive Graphs.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

A randomized, o(log w)-depth 2 smoothing network.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008
A new model for selfish routing.
Theor. Comput. Sci., 2008

Nash equilibria in discrete routing games with convex latency functions.
J. Comput. Syst. Sci., 2008

A graph-theoretic network security game.
IJAACS, 2008

Sequentially consistent versus linearizable counting networks.
Distributed Computing, 2008

How Many Attackers Can Selfish Defenders Catch?
CoRR, 2008

Cost Sharing Mechanisms for Fair Pricing of Resource Usage.
Algorithmica, 2008

A Network Game with Attackers and a Defender.
Algorithmica, 2008

Facets of the Fully Mixed Nash Equilibrium Conjecture.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

The impact of randomization in smoothing networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Voronoi Games on Cycle Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

How Many Attackers Can Selfish Defenders Catch?
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.
Theor. Comput. Sci., 2007

Universal Bufferless Packet Switching.
SIAM J. Comput., 2007

Performance and stability bounds for dynamic networks.
J. Parallel Distrib. Comput., 2007

Efficient bufferless packet switching on trees and leveled networks.
J. Parallel Distrib. Comput., 2007

The Price of Selfish Routing.
Algorithmica, 2007

Weighted Boolean Formula Games.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Congestion Games with Player-Specific Constants.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
The price of anarchy for polynomial social cost.
Theor. Comput. Sci., 2006

The Price of Anarchy for Restricted Parallel Links.
Parallel Processing Letters, 2006

Direct Routing: Algorithms and Complexity.
Algorithmica, 2006

Computing on a Partially Eponymous Ring.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

The Price of Defense.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

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

The Price of Defense and Fractional Matchings.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Structure and complexity of extreme Nash equilibria.
Theor. Comput. Sci., 2005

The cost of concurrent, low-contention Read&Modify&Write.
Theor. Comput. Sci., 2005

Game Theory Meets Theoretical Computer Science.
Theor. Comput. Sci., 2005

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control.
SIAM J. Comput., 2005

The Impact of Network Structure on the Stability of Greedy Protocols.
Theory Comput. Syst., 2005

Max-min Fair Flow Control Sensitive to Priorities.
Journal of Interconnection Networks, 2005

An Application of the Monotone Linearizability Lemma.
Bulletin of the EATCS, 2005

A Cost Mechanism for Fair Pricing of Resource Usage.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

A Graph-Theoretic Network Security Game.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

Network Game with Attacker and Protector Entities.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Cost Sharing Mechanisms for Fair Pricing of Resources Usage.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

2004
Universal Bufferless Routing.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Computing Nash equilibria for scheduling on restricted parallel links.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

A New Model for Selfish Routing.
Proceedings of the STACS 2004, 2004

The Price of Anarchy for Polynomial Social Cost.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Performance and Stability Bounds for Dynamic Networks.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Nash Equilibria in Discrete Routing Games with Convex Latency Functions.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Near-Optimal Hot-Potato Routing on Trees.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

Direct Routing: Algorithms and Complexity.
Proceedings of the Algorithms, 2004

2003
Trade-off results for connection management.
Theor. Comput. Sci., 2003

A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks.
Parallel Processing Letters, 2003

Approximate Equilibria and Ball Fusion.
Theory Comput. Syst., 2003

FIFO is Unstable at Arbitrarily Low Rates
Electronic Colloquium on Computational Complexity (ECCC), 2003

Instability of Networks with Quasi-Static Link Capacities.
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.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Which Is the Worst-Case Nash Equilibrium?
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Extreme Nash Equilibria.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

The Impact of Network Structure on the Stability of Greedy Protocols.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002
Threshold counters with increments and decrements.
Theor. Comput. Sci., 2002

Review of Introduction to Distributed Algorithms.
SIGACT News, 2002

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Approximate Equilibria and Ball Fusion.
Proceedings of the SIROCCO 9, 2002

The Structure and Complexity of Nash Equilibria for a Selfish Routing Game.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Distributed Systems and Algorithms.
Proceedings of the Euro-Par 2002, 2002

2001
The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example).
Bulletin of the EATCS, 2001

Stability in Routing: Networks and Protocols.
Bulletin of the EATCS, 2001

The price of selfish routing.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000
Annotated Bibliography on Counting Networks.
Bulletin of the EATCS, 2000

A Combinatorial Characterization of Properties Preserved by Antitokens.
Bulletin of the EATCS, 2000

Supporting Increment and Decrement Operations in Balancing Networks.
Chicago J. Theor. Comput. Sci., 2000

A Combinatorial Characterization of Properties Preserved by Antitokens.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
Linearizable Read/Write Objects.
Theor. Comput. Sci., 1999

Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions.
Proceedings of the Distributed Computing, 1999

Supporting Increment and Decrement Operations in Balancing Networks.
Proceedings of the STACS 99, 1999

Threshold Counters with Increments and Decrements.
Proceedings of the SIROCCO'99, 1999

Optimal, Distributed Decision-Making: The Case of no Communication.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Sequentially Consistent versus Linearizable Counting Networks.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Optimal, Distributed Decision-Making: The Case of No Communication.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
Proceedings of the SIROCCO'98, 1998

Contention in Balancing Networks Resolved (Extended Abstract).
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

MaxMin Fair Flow Control Sensitive to Priorities.
Proceedings of the Distributed Computing, 1998

An Efficient Counting Network.
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.
Inf. Sci., 1997

Impossibility Results for Weak Threshold Networks.
Inf. Process. Lett., 1997

Advances in Rate-Based Flow Control.
Proceedings of the SIROCCO'97, 1997

Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

The Impact of Timing on Linearizability in Counting Networks.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Trade-Off Results for Connection Management.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Timing-based connection management.
Proceedings of the Networks in Distributed Computing, 1997

1996
A Combinatorial Treatment of Balancing Networks.
J. ACM, 1996

Distributed, low contention task allocation.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Wait-Free Solvability Via Combinatorial Topology (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

The Strength of Counting Networks (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Load Balancing Networks (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

A Logarithmic Depth Counting Network (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

1994
Efficiency of Semisynchronous Versus.
Mathematical Systems Theory, 1994

The Impact of Synchronization on the Session Problem.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

A Combinatorial Treatment of Balancing Networks.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Contention in Counting Networks.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Proving Correctness for Balancing Networks.
Proceedings of the Workshop on Parallel Processing of Discrete Optimization Problems, 1994

1993
Notes on Sorting and Counting Networks (Extended Abstract).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

1992
Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

An upper and a lower bound for tick synchronization.
Proceedings of the Real-Time Systems Symposium, 1992


  Loading...