SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Equilibria for multiclass routing in multi-agent networks
7 references·8 citing·36 second hop
Equilibria for multiclass routing in multi-agent networks (2003)Equilibria for multiclass routing in mult…The Traffic Assignment Problem: Models and Methods (1994)The Traffic Assignment Proble…Competitive routing in multiuser communication networks (1993)Competitive routing in multiu…Optimal static load balancing in distributed computer systems (1985)Optimal static load balancing…On the relationship between Nash—Cournot and Wardrop equilibria (1985)On the relationship between N…Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)Open, Closed, and Mixed Netwo…The Traffic Assignment Problem for Multiclass-User Transportation Networks (1972)The Traffic Assignment Proble…Über ein Paradoxon aus der Verkehrsplanung (1968)Über ein Paradoxon aus der Ve…Pricing Traffic Networks with Mixed Vehicle Autonomy (2019)Pricing Traffic Networks with…Nash Equilibrium in a Road Network with Many Groups of Users (2019)Nash Equilibrium in a Road Ne…Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users (2007)Topological Uniqueness of the…Topological Conditions for Uniqueness of Equilibrium in Networks (2005)Topological Conditions for Un…Economic Foundations of Ohio River Navigation Investment Model (2004)Economic Foundations of Ohio …Social optimality and cooperation in nonatomic congestion games (2003)Social optimality and coopera…Non-cooperative routing in loss networks (2002)Non-cooperative routing in lo…NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS (2002)NASH EQUILIBRIA IN LOAD BALAN…Two-Person Cooperative Games (1953)A class of games possessing pure-strategy Nash equilibria (1973)Potential Games (1996)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Spatial and temporal price and allocation models (1971)Traffic Equilibrium and Variational Inequalities (1980)How bad is selfish routing? (2002)A survey on networking games in telecommunications (2004)Selfish Routing and the Price of Anarchy (2016)Dynamic Noncooperative Game Theory (1982)Achieving network optima using Stackelberg routing strategies (1997)The price of anarchy is independent of the network topology (2003)Games and Decisions (2015)Traffic assignment problem for a general network (1969)Equilibria on a Congested Transportation Network (1981)Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem (1992)Studies in the Economics of Transportation. (1956)Studies in the Economics of Transportation. (1957)Network economics: a variational inequality approach (1994)Strong equilibrium in cost sharing connection games (2007)Efficient graph topologies in network routing games (2008)Business as Usual: A Consumer Search Theory of Sticky Prices and Asymmetric Price Adjustment (2011)A Social Equilibrium Existence Theorem* (1952)The Equilibrium Existence Problem in Finite Network Congestion Games (2006)On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2010)Fragility of the commons under prospect-theoretic risk attitudes (2016)The Economics of Urban Transportation (2007)Trafficking Networks and the Mexican Drug War (2015)A review of open queueing network models of manufacturing systems (1992)Braess-like paradoxes in distributed computer systems (2000)Optimal state-free, size-aware dispatching for heterogeneous -type systems (2005)Mean-Value Analysis of Closed Multichain Queuing Networks (1980)Blocking in a Shared Resource Environment (1981)An introduction to queueing theory (1993)Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future (2001)The multi-class, multi-criteria traffic network equilibrium and systems optimum problem (2003)
this work references cited by second hop

References

  • 1975Open, Closed, and Mixed Networks of Queues with Different Classes of Customers2,411 cited
  • 1994The Traffic Assignment Problem: Models and Methods1,043 cited
  • 1968Über ein Paradoxon aus der Verkehrsplanung975 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 1985Optimal static load balancing in distributed computer systems398 cited
  • 1985On the relationship between Nash—Cournot and Wardrop equilibria328 cited
  • 1972The Traffic Assignment Problem for Multiclass-User Transportation Networks302 cited

Cited by

  • 2005Topological Conditions for Uniqueness of Equilibrium in Networks72 cited
  • 2003Social optimality and cooperation in nonatomic congestion games53 cited
  • 2007Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users44 cited
  • 2002Non-cooperative routing in loss networks38 cited
  • 2002NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS35 cited
  • 2019Pricing Traffic Networks with Mixed Vehicle Autonomy18 cited
  • 2019Nash Equilibrium in a Road Network with Many Groups of Users5 cited
  • 2004Economic Foundations of Ohio River Navigation Investment Model

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

4 cited