Browsing by Author "Monien, Burkhard"
Now showing items 120 of 27

Article
The complexity of equilibria for riskmodeling valuations
Mavronicolas, Marios; Monien, Burkhard (2016)Following the direction pioneered by Fiat and Papadimitriou in their 2010 paper [12], we study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than ...

Article
The complexity of pure equilibria in mixweighted congestion games on parallel links
Mavronicolas, Marios; Monien, Burkhard (2015)We revisit the simple class of weighted congestion games on parallel links [10], where each player has a nonnegative weight and her cost on the link she chooses is the sum of the weights of all players choosing the link. ...

Article
Computing Nash equilibria for scheduling on restricted parallel links
Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2010)We consider the problem of routing nusers on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the ...

Conference Object
Computing Nash equilibria for scheduling on restricted parallel links
Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2004)We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the ...

Article
Conditional ValueatRisk: Structure and complexity of equilibria
Mavronicolas, Marios; Monien, Burkhard (2020)Conditional ValueatRisk, denoted as CVaRα, is becoming the prevailing measure of risk over two paramount economic domains: the insurance domain and the financial domain

Article
Conditional valueatrisk: Structure and complexity of equilibria
Mavronicolas, Marios; Monien, Burkhard (2017)Conditional ValueatRisk, denoted as CVaRα, is becoming the prevailing measure of risk over two paramount economic domains: the insurance domain and the financial domain

Article
Congestion games with playerspecific constants
Mavronicolas, Marios; Milchtaich, I.; Monien, Burkhard; Tiemann, K. (2007)We consider a special case of weighted congestion games with playerspecific latency functions where each player uses for each particular resource a fixed (nondecreasing) delay function together with a playerspecific ...

Article
Extreme Nash equilibria
Gairing, M.; Lucking, T.; Mavronicolas, Marios; Monien, Burkhard; Spirakis, Paul G. (2003)We study the combinatorial structure and computational complexity of extreme Nash equilibria, ones that maximize or minimize a certain objective function, in the context of a selfish routing game. Specifically, we assume ...

Article
How many attackers can selfish defenders catch?
Mavronicolas, Marios; Monien, Burkhard; Lesta, Vicky Papadopoulou (2013)In a distributed system with attacks and defenses, both attackers and defenders are selfinterested entities. We assume a rewardsharing scheme among interdependent defenders

Conference Object
How many attackers can selfish defenders catch?
Mavronicolas, Marios; Monien, Burkhard; Lesta, Vicky Papadopoulou (2008)In a distributed system with attacks and defenses, an economic investment in defense mechanisms aims at increasing the degree of system protection against the attacks. We study such investments in the selfish setting, where ...

Article
Minimizing Expectation Plus Variance
Mavronicolas, Marios; Monien, Burkhard (2015)We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuationV (mapping probability distributions to reals)

Article
Minimizing expectation plus variance
Mavronicolas, Marios; Monien, Burkhard (2012)We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals)

Article
Nash equilibria for voronoi games on transitive graphs
Feldmann, R.; Mavronicolas, Marios; Monien, Burkhard (2009)In a Voronoi game, each of κ≥2 players chooses a vertex in a graph G=〈V(G), E(G)〉. The utility of a player measures her Voronoi cell: the set of vertices that are closest to her chosen vertex than to that of another player. ...

Article
Nash equilibria in discrete routing games with convex latency functions
Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2004)We study Nash equilibria in a discrete routing game that combines features of the two most famous models for noncooperative routing, the KP model [16] and the Wardrop model [27]. In our model, users share parallel links. ...

Article
Nash equilibria in discrete routing games with convex latency functions
Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2008)In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary nondecreasing, nonconstant ...

Article
A new model for selfish routing
Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2008)In this work, we introduce and study a new, potentially rich model for selfish routing over noncooperative networks, as an interesting hybridization of the two prevailing such models, namely the KPmodel [E. Koutsoupias, ...

Article
A new model for selfish routing
Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Rode, M. (2004)In this work, we introduce and study a new model for selfish routing over noncooperative networks that combines features from the two such best studied models, namely the KP model and the Wardrop model in an interesting ...

Book Chapter
NPhardness of equilibria in case of riskaverse players
Mavronicolas, Marios; Monien, Burkhard (Springer International Publishing, 2018)We study the complexity of deciding the existence of mixed equilibria for minimization games where players use valuations other than expectation to evaluate their costs. We consider riskaverse players seeking to minimize ...

Article
The price of anarchy for polynomial social cost
Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2006)In this work, we consider an interesting variant of the well studied KP model for selfish routing on parallel links, which reflects some influence from the much older Wardrop model [J.G. Wardrop, Some theoretical aspects ...

Article
The price of anarchy for polynomial social cost
Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard (2004)In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [31]. In the new model, user traffics are still unsplittable, ...