• Article  

      The complexity of pure equilibria in mix-weighted 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 non-negative weight and her cost on the link she chooses is the sum of the weights of all players choosing the link. ...
    • Conference Object  

      Distributed formation of balanced and bistochastic weighted digraphs in multi-agent systems 

      Charalambous, T.; Hadjicostis, Christoforos N. (2013)
      We propose two distributed algorithms, one for solving the weight-balance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information ...
    • 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 well-studied 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, ...