SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game
6 references·5 citing·33 second hop
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game (2004)Bounds for the convergence rate of random…Nashification and the Coordination Ratio for a Selfish Routing Game (2003)Nashification and the Coordin…Tight bounds for worst-case equilibria (2002)Tight bounds for worst-case e…The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (2002)The Structure and Complexity …Selfish traffic allocation for server farms (2002)Selfish traffic allocation fo…How bad is selfish routing? (2002)How bad is selfish routing?Worst-Case Equilibria (1999)Worst-Case EquilibriaLearning equilibria of games via payoff queries (2013)Learning equilibria of games …Load balancing via random local search in closed and open systems (2010)Load balancing via random loc…Distributed Selfish Load Balancing (2007)Distributed Selfish Load Bala…Distributed selfish load balancing (2006)Distributed selfish load bala…Distributed selfish load balancing (2006)Distributed selfish load bala…Non-Cooperative Games (1951)Non-cooperative games (1989)A Course in Game Theory (1994)Selfish unsplittable flows (2005)On nash equilibria for a network creation game (2006)Tight bounds for worst-case equilibria (2007)Queueing Systems. Volume 1: Theory (1975)Fundamentals of Queueing Theory. (1977)Personal communication (1989)Fast convergence of selfish rerouting (2005)On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (2006)Tradeoffs in worst-case equilibria (2006)A class of games possessing pure-strategy Nash equilibria (1973)Near-optimal network design with selfish agents (2003)The price of selfish behavior in bilateral network formation (2005)Strong price of anarchy (2008)Potential Games (1996)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Urban transportation networks: Equilibrium analysis with mathematical programming methods (1986)Applications of approximation algorithms to cooperative games (2001)Stackelberg scheduling strategies (2001)Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games (2004)The complexity of pure Nash equilibria (2004)The Theory of Learning in Games (1998)The Complexity of Computing a Nash Equilibrium (2009)Bounds for the query complexity of approximate equilibria (2014)Bounds for the Query Complexity of Approximate Equilibria (2016)Algorithms, games, and the internet (2001)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)A New Model for Selfish Routing (2004)Selfish Routing with Incomplete Information (2007)The structure and complexity of Nash equilibria for a selfish routing game (2008)
this work references cited by second hop

References

  • 1999Worst-Case Equilibria1,962 cited
  • 2002How bad is selfish routing?277 cited
  • 2002The Structure and Complexity of Nash Equilibria for a Selfish Routing Game218 cited
  • 2002Tight bounds for worst-case equilibria195 cited
  • 2003Nashification and the Coordination Ratio for a Selfish Routing Game107 cited
  • 2002Selfish traffic allocation for server farms97 cited

Cited by

  • 2007Distributed Selfish Load Balancing57 cited
  • 2006Distributed selfish load balancing51 cited
  • 2013Learning equilibria of games via payoff queries43 cited
  • 2006Distributed selfish load balancing40 cited
  • 2010Load balancing via random local search in closed and open systems24 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work