On the relationship between Nash—Cournot and Wardrop equilibria

Noncooperative games (91A10) Deterministic network models in operations research (90B10) Other game-theoretic models (91A40) General equilibrium theory (91B50)

Related Items

Competitive routing of traffic flows by navigation providers, Linear-quadratic-Gaussian mean-field-game with partial observation and common noise, Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems, NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS, Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium, Uniqueness of equilibria in atomic splittable polymatroid congestion games, On the Uniqueness of Equilibrium in Atomic Splittable Routing Games, Nonatomic aggregative games with infinitely many types, Equilibrium computation in resource allocation games, Disequilibrium and variational inequalities, The charges on the paths, Coalitions in Nonatomic Network Congestion Games, Bio-inspired paradigms in network engineering games, Network design problem with congestion effects: A case of bilevel programming, Network games; adaptations to Nash-Cournot equilibrium, ``Cap and trade for congestion control, Braess's paradox for flows over time, Reaction function based dynamic location modeling in Stackelberg-Nash-Cournot competition, Wardrop equilibrium on time-varying graphs, A convergence analysis of the price of anarchy in atomic congestion games, Equilibria in a class of aggregative location games, Semiparametric estimation of McKean-Vlasov SDEs, Cooperative networks games with elastic demands, An Infinite-Horizon Mean Field Game of Growth and Capital Accumulation: A Markov Chain Approximation Numerical Scheme and Its Challenges, Load Balancing Congestion Games and Their Asymptotic Behavior, Toll caps in privatized road networks, Stationary anonymous sequential games with undiscounted rewards, Mixed equilibria with common constraints on transportation networks, The problem of capacity addition in multi-user elastic demand communication networks, Multiclass multicriteria mixed equilibrium on networks and uniform link tolls for system optimum, GAMES OF CROWDING, Stackelberg strategies and collusion in network games with splittable flow, A selfish routing based network improvement problem, Equilibria for networks with malicious users, A review of transport market modeling using game-theoretic principles, Congestion Games with Variable Demands, A Survey of Uniqueness Results for Selfish Routing, Dynamic Atomic Congestion Games with Seasonal Flows, Minimal-time mean field games, Solution differentiability for oligopolistic network equilibria, Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess paradoxes, Management of Variable Data Streams in Networks, Efficiency of atomic splittable selfish routing with polynomial cost functions, Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games, A survey on networking games in telecommunications, Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems, Load balancing congestion games and their asymptotic behavior, A mixed traffic assignment problem and its upper bound of efficiency loss, Dynamical systems and variational inequalities, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Calmness of a perturbed Cournot Oligopoly Game with nonsmooth cost functions, Finite composite games: equilibria and dynamics

Cites Work