SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On the relationship between Nash—Cournot and Wardrop equilibria
6 references·16 citing·34 second hop
On the relationship between Nash—Cournot and Wardrop equilibria (1985)On the relationship between Nash—Cournot …An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs (1984)An Efficient Method for Compu…Traffic Equilibrium and Variational Inequalities (1980)Traffic Equilibrium and Varia…The existence, uniqueness and stability of traffic equilibria (1979)The existence, uniqueness and…Spatial and temporal price and allocation models (1971)Spatial and temporal price an…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…Nash and Wardrop Equilibria in Aggregative Games with Coupling Constraints (2019)Nash and Wardrop Equilibria i…Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints (2018)Nash and Wardrop Equilibria i…Optimal design of autonomous vehicle zones in transportation networks (2017)Optimal design of autonomous …Mean Field Games (2017)Mean Field GamesSelfish Routing and the Price of Anarchy (2016)Selfish Routing and the Price…Boundedly rational route choice behavior: A review of models and methodologies (2016)Boundedly rational route choi…The Impact of Oligopolistic Competition in Networks (2009)The Impact of Oligopolistic C…Methodologies for analyzing equilibria in wireless games (2009)Methodologies for analyzing e…Stackelberg games and multiple equilibrium behaviors on networks (2007)Stackelberg games and multipl…A survey on networking games in telecommunications (2004)A survey on networking games …Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users (2002)Nash equilibria for combined …How bad is selfish routing? (2002)How bad is selfish routing?Competitive routing in networks with polynomial costs (2002)Competitive routing in networ…Multiple Equilibrium Behaviors on Networks (1988)Multiple Equilibrium Behavior…Oligopolistic and competitive behavior of spatially separated markets (1987)Oligopolistic and competitive…Alternative Models of Spatial Competition (1986)Alternative Models of Spatial…Studies in the Economics of Transportation. (1956)Studies in the Economics of Transportation. (1957)Optimal strategies: A new assignment model for transit networks (1989)A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem (1993)Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future (2001)The Bargaining Problem (1950)The Evolution of Cooperation (1981)Evolution and the Theory of Games (1988)Game Theory in Wireless Networks: A Tutorial (2006)Distributed Welfare Games (2013)Real and Complex Monotone Communication Games (2014)An efficient approach to solving the road network equilibrium traffic assignment problem (1975)Equilibrium traffic assignment for large scale transit networks (1988)Transit Assignment for Congested Public Transport Systems: An Equilibrium Model (1993)Network with degradable links: capacity analysis and design (2003)The Economics of Welfare (1933)Non-cooperative games (1989)A Course in Game Theory (1994)Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation (2012)A class of games possessing pure-strategy Nash equilibria (1973)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)Balanced-budget redistribution as the outcome of political competition (1987)Competitive routing in multiuser communication networks (1993)A probabilistic multipath traffic assignment model which obviates path enumeration (1971)The complexity of pure Nash equilibria (2004)Testing Market Integration (1986)Cointegration Tests and Spatial Price Linkages in Regional Cattle Markets (1991)Combining bottom-up and top-down (2007)Predicting the adoption of connected autonomous vehicles: A new approach based on the theory of diffusion of innovations (2018)Multiclass traffic assignment model for mixed traffic flow of human-driven vehicles and connected and autonomous vehicles (2019)Strategic planning of dedicated autonomous vehicle lanes and autonomous vehicle/toll lanes in transportation networks (2019)
this work references cited by second hop

References

  • 1965Existence and Uniqueness of Equilibrium Points for Concave N-Person Games2,693 cited
  • 1971Spatial and temporal price and allocation models997 cited
  • 1980Traffic Equilibrium and Variational Inequalities931 cited
  • 1979The existence, uniqueness and stability of traffic equilibria857 cited
  • 1969Traffic assignment problem for a general network688 cited
  • 1984An Efficient Method for Computing Traffic Equilibria in Networks with Asymmetric Transportation Costs440 cited

Cited by

  • 2016Selfish Routing and the Price of Anarchy647 cited
  • 2004A survey on networking games in telecommunications553 cited
  • 2002How bad is selfish routing?277 cited
  • 2017Optimal design of autonomous vehicle zones in transportation networks239 cited
  • 2002Competitive routing in networks with polynomial costs213 cited
  • 2009Methodologies for analyzing equilibria in wireless games193 cited
  • 2016Boundedly rational route choice behavior: A review of models and methodologies183 cited
  • 1987Oligopolistic and competitive behavior of spatially separated markets177 cited
  • 1988Multiple Equilibrium Behaviors on Networks174 cited

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

  • 1986Alternative Models of Spatial Competition165 cited
  • 2007Stackelberg games and multiple equilibrium behaviors on networks137 cited
  • 2002Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users134 cited
  • 2019Nash and Wardrop Equilibria in Aggregative Games with Coupling Constraints118 cited
  • 2009The Impact of Oligopolistic Competition in Networks117 cited
  • 2018Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints109 cited
  • 2017Mean Field Games107 cited