SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
11 references·0 citing·35 second hop
NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS (2002)NASH EQUILIBRIA IN LOAD BALANCING IN DIST…Equilibria for multiclass routing in multi-agent networks (2003)Equilibria for multiclass rou…Optimal routing control: game theoretic approach (2002)Optimal routing control: game…Competitive routing in networks with polynomial costs (2002)Competitive routing in networ…Braess-like paradoxes in distributed computer systems (2000)Braess-like paradoxes in dist…Capacity allocation under noncooperative routing (1997)Capacity allocation under non…Uniqueness of the solution for optimal static routing in open BCMP queueing networks (1995)Uniqueness of the solution fo…Competitive routing in multiuser communication networks (1993)Competitive routing in multiu…On the relationship between Nash—Cournot and Wardrop equilibria (1985)On the relationship between N…The Traffic Assignment Problem for Multiclass-User Transportation Networks (1972)The Traffic Assignment Proble…Traffic assignment problem for a general network (1969)Traffic assignment problem fo…Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Existence and Uniqueness of E…Spatial and temporal price and allocation models (1971)Traffic Equilibrium and Variational Inequalities (1980)How bad is selfish routing? (2002)Selfish Routing and the Price of Anarchy (2016)Optimal static load balancing in distributed computer systems (1985)Non-cooperative routing in loss networks (2002)Inefficient Noncooperation in Networking Games of Common-Pool Resources (2008)Inefficiency in stochastic queueing systems with strategic customers (2021)Dynamic Noncooperative Game Theory (1982)The price of anarchy is independent of the network topology (2003)Games and Decisions (2015)The Traffic Assignment Problem: Models and Methods (1994)A Stackelberg Network Game with a Large Number of Followers (2002)Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users (2002)The Impact of Oligopolistic Competition in Networks (2009)Über ein Paradoxon aus der Verkehrsplanung (1968)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Social optimality and cooperation in nonatomic congestion games (2003)Topological Conditions for Uniqueness of Equilibrium in Networks (2005)Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users (2007)Game theory: analysis of conflict (1992)Achieving network optima using Stackelberg routing strategies (1997)Atomic Resource Sharing in Noncooperative Networks (2001)Stackelberg scheduling strategies (2001)Optimal routing control: repeated game approach (2002)A Non-cooperative Equilibrium for Supergames (1971)Game Theory for Applied Economists (1992)Equilibria for Multiclass Routing Problems in Multi-Agent Networks (2007)Nash Equilibrium in a Road Network with Many Groups of Users (2019)Balanced-budget redistribution as the outcome of political competition (1987)A survey on networking games in telecommunications (2004)A probabilistic multipath traffic assignment model which obviates path enumeration (1971)The complexity of pure Nash equilibria (2004)Equilibria on a Congested Transportation Network (1981)Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem (1992)
this work references cited by second hop

References

  • 1965Existence and Uniqueness of Equilibrium Points for Concave N-Person Games2,693 cited
  • 1969Traffic assignment problem for a general network688 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 1985On the relationship between Nash—Cournot and Wardrop equilibria328 cited
  • 1972The Traffic Assignment Problem for Multiclass-User Transportation Networks302 cited
  • 2002Competitive routing in networks with polynomial costs213 cited
  • 1997Capacity allocation under noncooperative routing148 cited
  • 2000Braess-like paradoxes in distributed computer systems72 cited
  • 2003Equilibria for multiclass routing in multi-agent networks51 cited
  • 2002Optimal routing control: game theoretic approach49 cited
  • 1995Uniqueness of the solution for optimal static routing in open BCMP queueing networks30 cited

Cited by

No citing works inside the corpus for this window.

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