Marios Mavronicolas

From MaRDI portal
Person:235719

Available identifiers

zbMath Open mavronicolas.mariosMaRDI QIDQ235719

List of research outcomes

PublicationDate of PublicationType
$$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players2023-06-30Paper
Trade-off results for connection management2022-12-09Paper
(In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions2022-10-04Paper
The price of defense2021-04-19Paper
The complexity of computational problems about Nash equilibria in symmetric win-lose games2021-03-26Paper
The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values2021-03-09Paper
Conditional value-at-risk: structure and complexity of equilibria2020-01-22Paper
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games2018-04-19Paper
Conditional value-at-risk: structure and complexity of equilibria2018-02-13Paper
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.2018-01-24Paper
Complexity of rational and irrational Nash equilibria2017-11-07Paper
A combinatorial treatment of balancing networks2017-09-29Paper
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)2017-09-29Paper
Impossibility results for weak threshold networks2016-05-26Paper
The complexity of equilibria for risk-modeling valuations2016-05-18Paper
Contention in balancing networks resolved (extended abstract)2016-03-02Paper
Weighted Boolean Formula Games2016-01-27Paper
Minimizing expectation plus variance2016-01-13Paper
The complexity of pure equilibria in mix-weighted congestion games on parallel links2015-09-15Paper
Sequentially consistent versus linearizable counting networks2015-09-11Paper
A distributed algorithm for gathering many fat mobile robots in the plane2015-03-02Paper
The price of selfish routing2015-02-27Paper
The impact of randomization in smoothing networks2014-12-12Paper
How many attackers can selfish defenders catch?2014-04-10Paper
Sequentially consistent versus linearizable counting networks2013-06-28Paper
The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games2013-03-13Paper
Minimizing Expectation Plus Variance2013-03-13Paper
Complexity of Rational and Irrational Nash Equilibria2011-10-28Paper
Computing Nash equilibria for scheduling on restricted parallel links2010-10-06Paper
The impact of randomization in smoothing networks2010-09-09Paper
Computing Nash equilibria for scheduling on restricted parallel links2010-08-15Paper
Facets of the fully mixed Nash equilibrium conjecture2010-08-13Paper
An efficient counting network2010-08-11Paper
https://portal.mardi4nfdi.de/entity/Q35681052010-06-17Paper
Theoretical Computer Science2010-02-23Paper
A substitution theorem for graceful trees and its applications2009-12-09Paper
https://portal.mardi4nfdi.de/entity/Q33965502009-09-19Paper
The structure and complexity of Nash equilibria for a selfish routing game2009-08-21Paper
Computing on a partially eponymous ring2009-03-02Paper
Voronoi Games on Cycle Graphs2009-02-03Paper
Nash equilibria in discrete routing games with convex latency functions2008-11-19Paper
A new model for selfish routing2008-11-12Paper
Congestion Games with Player-Specific Constants2008-09-17Paper
Cost sharing mechanisms for fair pricing of resource usage2008-09-12Paper
Universal Bufferless Packet Switching2008-08-14Paper
A network game with attackers and a defender2008-07-01Paper
Facets of the Fully Mixed Nash Equilibrium Conjecture2008-05-02Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
Efficient bufferless packet switching on trees and leveled networks2007-10-24Paper
STACS 20042007-10-01Paper
The Price of Defense2007-09-05Paper
The increase of the instability of networks due to quasi-static link capacities2007-09-03Paper
The price of selfish routing2007-07-19Paper
Direct routing: Algorithms and complexity2007-06-21Paper
Performance and stability bounds for dynamic networks2007-04-26Paper
The price of anarchy for polynomial social cost2007-01-09Paper
Algorithms and Computation2006-11-14Paper
The impact of network structure on the stability of greedy protocols2006-02-08Paper
Approximation and Online Algorithms2005-12-14Paper
Structure and complexity of extreme Nash equilibria2005-10-26Paper
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control2005-09-16Paper
Automata, Languages and Programming2005-08-24Paper
Euro-Par 2004 Parallel Processing2005-08-23Paper
Mathematical Foundations of Computer Science 20042005-08-22Paper
Algorithms – ESA 20042005-08-18Paper
https://portal.mardi4nfdi.de/entity/Q46687342005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46687392005-04-15Paper
The cost of concurrent, low-contention Read \& Modify \& Write2005-04-06Paper
Approximate equilibria and ball fusion2005-02-11Paper
https://portal.mardi4nfdi.de/entity/Q48131012004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47371502004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44371162003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44375132003-12-02Paper
Trade-off results for connection management2003-01-21Paper
Threshold counters with increments and decrements2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27436862001-09-27Paper
https://portal.mardi4nfdi.de/entity/Q45038292001-09-04Paper
https://portal.mardi4nfdi.de/entity/Q27292382001-07-18Paper
https://portal.mardi4nfdi.de/entity/Q27092362001-05-15Paper
https://portal.mardi4nfdi.de/entity/Q42507872000-11-22Paper
https://portal.mardi4nfdi.de/entity/Q49343382000-04-26Paper
Linearizable read/write objects1999-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42328871999-03-16Paper
A \(q\)-analog of approximation inclusion-exclusion1998-10-19Paper
A combinatorial treatment of balancing networks1998-01-22Paper
https://portal.mardi4nfdi.de/entity/Q48592261996-11-04Paper
Efficiency of semisynchronous versus asynchronous networks1994-10-30Paper
Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory1993-02-22Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Marios Mavronicolas