Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarios Mavronicolas
Person information
- affiliation: University of Cyprus, Nicosia, Cyprus
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j60]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): 957-995 (2022)- 2021
- [j59]Vittorio Bilò, Marios Mavronicolas:
The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games. Algorithmica 83(2): 447-530 (2021) - [j58]Marios Mavronicolas, Loizos Michael, Vicky Papadopoulou Lesta, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis:
The Price of Defense. Algorithmica 83(5): 1256-1315 (2021) - [j57]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: 84-97 (2021) - [j56]Vittorio Bilò, Marios Mavronicolas:
∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games. ACM Trans. Economics and Comput. 9(3): 14:1-14:25 (2021) - 2020
- [j55]Marios Mavronicolas, Burkhard Monien:
Conditional Value-at-Risk: Structure and complexity of equilibria. Theor. Comput. Sci. 807: 266-283 (2020) - [i9]Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien:
(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations. CoRR abs/2009.04425 (2020)
2010 – 2019
- 2019
- [i8]Vittorio Bilò, Marios Mavronicolas:
The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games. CoRR abs/1907.10468 (2019) - 2018
- [c74]Marios Mavronicolas, Burkhard Monien:
NP NP -Hardness of Equilibria in Case of Risk-Averse Players. Adventures Between Lower Bounds and Higher Altitudes 2018: 409-422 - 2017
- [c73]Marios Mavronicolas, Burkhard Monien:
Conditional Value-at-Risk: Structure and Complexity of Equilibria. SAGT 2017: 131-143 - [c72]Vittorio Bilò, Marios Mavronicolas:
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. STACS 2017: 13:1-13:14 - 2016
- [j54]Marios Mavronicolas, Burkhard Monien:
The complexity of equilibria for risk-modeling valuations. Theor. Comput. Sci. 634: 67-96 (2016) - [c71]Vittorio Bilò, Marios Mavronicolas:
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. STACS 2016: 17:1-17:13 - 2015
- [j53]Marios Mavronicolas, Burkhard Monien:
The complexity of pure equilibria in mix-weighted congestion games on parallel links. Inf. Process. Lett. 115(12): 927-931 (2015) - [j52]Marios Mavronicolas, Burkhard Monien:
Minimizing Expectation Plus Variance. Theory Comput. Syst. 57(3): 617-654 (2015) - [c70]Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner:
Weighted Boolean Formula Games. Algorithms, Probability, Networks, and Games 2015: 49-86 - [i7]Marios Mavronicolas, Burkhard Monien:
The Complexity of Equilibria for Risk-Modeling Valuations. CoRR abs/1510.08980 (2015) - 2014
- [j51]Vittorio Bilò, Marios Mavronicolas:
Complexity of Rational and Irrational Nash Equilibria. Theory Comput. Syst. 54(3): 491-527 (2014) - 2013
- [j50]Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou Lesta:
How many attackers can selfish defenders catch? Discret. Appl. Math. 161(16-17): 2563-2586 (2013) - [c69]Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas:
A distributed algorithm for gathering many fat mobile robots in the plane. PODC 2013: 250-259 - 2012
- [c68]Andrzej Goscinski, Marios Mavronicolas, Weisong Shi, Yong Meng Teo:
Topic 8: Distributed Systems and Algorithms. Euro-Par 2012: 401-402 - [c67]Vittorio Bilò, Marios Mavronicolas:
The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games. SAGT 2012: 37-48 - [c66]Marios Mavronicolas, Burkhard Monien:
Minimizing Expectation Plus Variance. SAGT 2012: 239-250 - [i6]Chrysovalandis Agathangelou, Chryssis Georgiou, Marios Mavronicolas:
A Distributed Algorithm for Gathering Many Fat Mobile Robots in the Plane. CoRR abs/1209.3904 (2012) - 2011
- [j49]Marios Mavronicolas:
Preface: Algorithmic Game Theory. Theory Comput. Syst. 49(1): 1-2 (2011) - [c65]Vittorio Bilò, Marios Mavronicolas:
Complexity of Rational and Irrational Nash Equilibria. SAGT 2011: 200-211 - 2010
- [j48]Marios Mavronicolas, Thomas Sauerwald:
The impact of randomization in smoothing networks. Distributed Comput. 22(5-6): 381-411 (2010) - [j47]Marios Mavronicolas:
Some Algorithmic Questions About Nash Equilibria. Bull. EATCS 100: 35-51 (2010) - [j46]Rainer Feldmann, Marios Mavronicolas, Andreas Pieris:
Facets of the Fully Mixed Nash Equilibrium Conjecture. Theory Comput. Syst. 47(1): 60-112 (2010) - [j45]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
Computing Nash Equilibria for Scheduling on Restricted Parallel Links. Theory Comput. Syst. 47(2): 405-432 (2010) - [j44]Costas Busch, Marios Mavronicolas:
An efficient counting network. Theor. Comput. Sci. 411(34-36): 3001-3030 (2010)
2000 – 2009
- 2009
- [j43]Marios Mavronicolas, Paul G. Spirakis:
A glimpse at Christos H. Papadimitriou. Comput. Sci. Rev. 3(2): 55-63 (2009) - [j42]Marios Mavronicolas, Loizos Michael:
A substitution theorem for graceful trees and its applications. Discret. Math. 309(12): 3757-3766 (2009) - [j41]Marios Mavronicolas:
Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer). SIGACT News 40(2): 25-27 (2009) - [j40]Marios Mavronicolas, Loizos Michael, Paul G. Spirakis:
Computing on a partially eponymous ring. Theor. Comput. Sci. 410(6-7): 595-613 (2009) - [j39]Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis:
Preface. Theor. Comput. Sci. 410(17): 1551 (2009) - [j38]Marios Mavronicolas:
Preface. Theor. Comput. Sci. 410(36): 3303-3304 (2009) - [j37]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): 3305-3326 (2009) - [c64]Marios Mavronicolas, Thomas Sauerwald:
A randomized, o(log w)-depth 2 smoothing network. SPAA 2009: 178-187 - [c63]Rainer Feldmann, Marios Mavronicolas, Burkhard Monien:
Nash Equilibria for Voronoi Games on Transitive Graphs. WINE 2009: 280-291 - [e4]Marios Mavronicolas, Vicky G. Papadopoulou:
Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5814, Springer 2009, ISBN 978-3-642-04644-5 [contents] - 2008
- [j36]Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul G. Spirakis:
A Network Game with Attackers and a Defender. Algorithmica 51(3): 315-341 (2008) - [j35]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
Cost Sharing Mechanisms for Fair Pricing of Resource Usage. Algorithmica 52(1): 19-43 (2008) - [j34]Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
Sequentially consistent versus linearizable counting networks. Distributed Comput. 21(4): 249-269 (2008) - [j33]Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
A graph-theoretic network security game. Int. J. Auton. Adapt. Commun. Syst. 1(4): 390-410 (2008) - [j32]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): 1199-1225 (2008) - [j31]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
A new model for selfish routing. Theor. Comput. Sci. 406(3): 187-206 (2008) - [c62]Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou:
How Many Attackers Can Selfish Defenders Catch? HICSS 2008: 470 - [c61]Marios Mavronicolas, Burkhard Monien, Vicky G. Papadopoulou, Florian Schoppmann:
Voronoi Games on Cycle Graphs. MFCS 2008: 503-514 - [c60]Marios Mavronicolas, Thomas Sauerwald:
The impact of randomization in smoothing networks. PODC 2008: 345-354 - [c59]Rainer Feldmann, Marios Mavronicolas, Andreas Pieris:
Facets of the Fully Mixed Nash Equilibrium Conjecture. SAGT 2008: 145-157 - [i5]Marios Mavronicolas, Burkhard Monien, Vicky Papadopoulou:
How Many Attackers Can Selfish Defenders Catch? CoRR abs/0812.4206 (2008) - 2007
- [j30]Marios Mavronicolas, Paul G. Spirakis:
The Price of Selfish Routing. Algorithmica 48(1): 91-126 (2007) - [j29]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
Performance and stability bounds for dynamic networks. J. Parallel Distributed Comput. 67(4): 386-399 (2007) - [j28]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas:
Efficient bufferless packet switching on trees and leveled networks. J. Parallel Distributed Comput. 67(11): 1168-1186 (2007) - [j27]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas:
Universal Bufferless Packet Switching. SIAM J. Comput. 37(4): 1139-1162 (2007) - [j26]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): 44-56 (2007) - [c58]Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann:
Congestion Games with Player-Specific Constants. MFCS 2007: 633-644 - [c57]Marios Mavronicolas, Burkhard Monien, Klaus W. Wagner:
Weighted Boolean Formula Games. WINE 2007: 469-481 - 2006
- [j25]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
Direct Routing: Algorithms and Complexity. Algorithmica 45(1): 45-68 (2006) - [j24]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Restricted Parallel Links. Parallel Process. Lett. 16(1): 117-132 (2006) - [j23]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The price of anarchy for polynomial social cost. Theor. Comput. Sci. 369(1-3): 116-135 (2006) - [c56]Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis:
The Price of Defense and Fractional Matchings. ICDCN 2006: 115-126 - [c55]Marina Gelastou, Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
The Power of the Defender. ICDCS Workshops 2006: 37 - [c54]Marios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
The Price of Defense. MFCS 2006: 717-728 - [c53]Marios Mavronicolas, Loizos Michael, Paul G. Spirakis:
Computing on a Partially Eponymous Ring. OPODIS 2006: 380-394 - [e3]Paul G. Spirakis, Marios Mavronicolas, Spyros C. Kontogiannis:
Internet and Network Economics, Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings. Lecture Notes in Computer Science 4286, Springer 2006, ISBN 3-540-68138-8 [contents] - 2005
- [j22]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
An Application of the Monotone Linearizability Lemma. Bull. EATCS 85: 70-80 (2005) - [j21]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Max-min Fair Flow Control Sensitive to Priorities. J. Interconnect. Networks 6(2): 85-114 (2005) - [j20]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): 425-460 (2005) - [j19]Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. SIAM J. Comput. 34(5): 1216-1252 (2005) - [j18]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
The cost of concurrent, low-contention Read&Modify&Write. Theor. Comput. Sci. 333(3): 373-400 (2005) - [j17]Samson Abramsky, Marios Mavronicolas:
Game Theory Meets Theoretical Computer Science. Theor. Comput. Sci. 343(1-2): 1-3 (2005) - [j16]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): 133-157 (2005) - [c52]Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
Network Game with Attacker and Protector Entities. ISAAC 2005: 288-297 - [c51]Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE 2005: 195-209 - [c50]Marios Mavronicolas, Panagiota N. Panagopoulou, Paul G. Spirakis:
A Cost Mechanism for Fair Pricing of Resource Usage. WINE 2005: 210-224 - [c49]Marios Mavronicolas, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis:
A Graph-Theoretic Network Security Game. WINE 2005: 969-978 - [i4]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost. Computing and Markets 2005 - [i3]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 - [i2]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 - 2004
- [c48]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis:
Direct Routing: Algorithms and Complexity. ESA 2004: 134-145 - [c47]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer:
Near-Optimal Hot-Potato Routing on Trees. Euro-Par 2004: 820-827 - [c46]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
Nash Equilibria in Discrete Routing Games with Convex Latency Functions. ICALP 2004: 645-657 - [c45]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
Performance and Stability Bounds for Dynamic Networks. ISPAN 2004: 239-246 - [c44]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
The Price of Anarchy for Polynomial Social Cost. MFCS 2004: 574-585 - [c43]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode:
A New Model for Selfish Routing. STACS 2004: 547-558 - [c42]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
Computing Nash equilibria for scheduling on restricted parallel links. STOC 2004: 613-622 - [c41]Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas:
Universal Bufferless Routing. WAOA 2004: 239-252 - 2003
- [j15]Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
Approximate Equilibria and Ball Fusion. Theory Comput. Syst. 36(6): 683-693 (2003) - [j14]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): 615-627 (2003) - [j13]Marios Mavronicolas, Nikos Papadakis:
Trade-off results for connection management. Theor. Comput. Sci. 290(1): 1-57 (2003) - [c40]Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
The Impact of Network Structure on the Stability of Greedy Protocols. CIAC 2003: 251-263 - [c39]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: 1003-1016 - [c38]Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Extreme Nash Equilibria. ICTCS 2003: 1-20 - [c37]Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto:
Which Is the Worst-Case Nash Equilibrium? MFCS 2003: 551-561 - [c36]Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
The Cost of Concurrent, Low-Contention Read-Modify-Write. SIROCCO 2003: 57-72 - [c35]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
Instability of Networks with Quasi-Static Link Capacities. SIROCCO 2003: 179-194 - [i1]Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis:
FIFO is Unstable at Arbitrarily Low Rates. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j12]Marios Mavronicolas:
Review of Introduction to Distributed Algorithms. SIGACT News 33(2): 16-18 (2002) - [j11]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
Threshold counters with increments and decrements. Theor. Comput. Sci. 270(1-2): 811-826 (2002) - [c34]Marios Mavronicolas, André Schiper:
Distributed Systems and Algorithms. Euro-Par 2002: 551-552 - [c33]Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134 - [c32]Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis:
Approximate Equilibria and Ball Fusion. SIROCCO 2002: 223-235 - [c31]Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols. DISC 2002: 88-102 - 2001
- [j10]Marios Mavronicolas:
The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example). Bull. EATCS 73: 99-106 (2001) - [j9]Marios Mavronicolas:
Stability in Routing: Networks and Protocols. Bull. EATCS 74: 119-134 (2001) - [c30]Marios Mavronicolas, Paul G. Spirakis:
The price of selfish routing. STOC 2001: 510-519 - 2000
- [j8]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. Chic. J. Theor. Comput. Sci. 2000 (2000) - [j7]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
A Combinatorial Characterization of Properties Preserved by Antitokens. Bull. EATCS 71: 114-132 (2000) - [j6]Marios Mavronicolas:
Annotated Bibliography on Counting Networks. Bull. EATCS 72: 123-132 (2000) - [c29]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
A Combinatorial Characterization of Properties Preserved by Antitokens. Euro-Par 2000: 575-582
1990 – 1999
- 1999
- [j5]Marios Mavronicolas, Dan Roth:
Linearizable Read/Write Objects. Theor. Comput. Sci. 220(1): 267-319 (1999) - [c28]Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis:
Optimal, Distributed Decision-Making: The Case of No Communication. FCT 1999: 293-303 - [c27]Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld:
Sequentially Consistent versus Linearizable Counting Networks. PODC 1999: 133-142 - [c26]Marios Mavronicolas, Paul G. Spirakis:
Optimal, Distributed Decision-Making: The Case of no Communication. PODC 1999: 279 - [c25]Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
Threshold Counters with Increments and Decrements. SIROCCO 1999: 47-61 - [c24]William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403 - [c23]Maria Eleftheriou, Marios Mavronicolas:
Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions. DISC 1999: 327-341 - [e2]Marios Mavronicolas, Michael Merritt, Nir Shavit:
Networks in Distributed Computing, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 27-29, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 45, DIMACS/AMS 1999, ISBN 978-0-8218-0992-1 [contents] - 1998
- [c22]