Browsing by Subject "Latency costs"

Now showing items 1-3 of 3

    • Article  

      Structure and complexity of extreme Nash equilibria 

      Gairing, M.; Lücking, T.; Mavronicolas, Marios; Monien, Burkhard; Spirakis, Paul G. (2005)
      We study extreme Nash equilibria in the context of a selfish routing game. Specifically, we assume a collection of n users, each employing a mixed strategy, which is a probability distribution over m parallel identical ...
    • Article  

      The structure and complexity of Nash equilibria for a selfish routing game 

      Fotakis, Dimitris A.; Kontogiannis, Spyros C.; Koutsoupias, Elias; Mavronicolas, Marios; Spirakis, Paul G. (2009)
      In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...
    • Article  

      The structure and complexity of Nash equilibria for a selfish routing game 

      Fotakis, Dimitris A.; Kontogiannis, Spyros C.; Koutsoupias, Elias; Mavronicolas, Marios; Spirakis, Paul G. (2002)
      In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...