Pages that link to "Item:Q3703616"
From MaRDI portal
The following pages link to On the relationship between Nash—Cournot and Wardrop equilibria (Q3703616):
Displayed 50 items.
- Finite composite games: equilibria and dynamics (Q261241) (← links)
- Competitive routing of traffic flows by navigation providers (Q278911) (← links)
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium (Q298924) (← links)
- Bio-inspired paradigms in network engineering games (Q351783) (← links)
- ``Cap and trade'' for congestion control (Q369468) (← links)
- Braess's paradox for flows over time (Q372993) (← links)
- Stationary anonymous sequential games with undiscounted rewards (Q493048) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- A selfish routing based network improvement problem (Q545450) (← links)
- Mixed equilibria with common constraints on transportation networks (Q681457) (← links)
- Solution differentiability for oligopolistic network equilibria (Q751976) (← links)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
- Linear-quadratic-Gaussian mean-field-game with partial observation and common noise (Q829005) (← links)
- Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems (Q836011) (← links)
- The charges on the paths (Q856107) (← links)
- Reaction function based dynamic location modeling in Stackelberg-Nash-Cournot competition (Q883199) (← links)
- Equilibria in a class of aggregative location games (Q898688) (← links)
- Equilibria for networks with malicious users (Q985313) (← links)
- Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess paradoxes (Q1021602) (← links)
- Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
- Dynamical systems and variational inequalities (Q1308651) (← links)
- Uniqueness of equilibria in atomic splittable polymatroid congestion games (Q1631639) (← links)
- Wardrop equilibrium on time-varying graphs (Q1680914) (← links)
- Toll caps in privatized road networks (Q1734347) (← links)
- Network games; adaptations to Nash-Cournot equilibrium (Q1918427) (← links)
- A review of transport market modeling using game-theoretic principles (Q2030641) (← links)
- Load balancing congestion games and their asymptotic behavior (Q2087126) (← links)
- Calmness of a perturbed Cournot Oligopoly Game with nonsmooth cost functions (Q2116022) (← links)
- Nonatomic aggregative games with infinitely many types (Q2140304) (← links)
- Equilibrium computation in resource allocation games (Q2149542) (← links)
- A mixed traffic assignment problem and its upper bound of efficiency loss (Q2336305) (← links)
- The problem of capacity addition in multi-user elastic demand communication networks (Q2474556) (← links)
- Multiclass multicriteria mixed equilibrium on networks and uniform link tolls for system optimum (Q2477675) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- Numerical studies on a paradox for non-cooperative static load balancing in distributed computer systems (Q2567165) (← links)
- Disequilibrium and variational inequalities (Q2640423) (← links)
- Semiparametric estimation of McKean-Vlasov SDEs (Q2686604) (← links)
- GAMES OF CROWDING (Q2762239) (← links)
- Congestion Games with Variable Demands (Q2800374) (← links)
- Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games (Q2835665) (← links)
- Coalitions in Nonatomic Network Congestion Games (Q2925351) (← links)
- On the Uniqueness of Equilibrium in Atomic Splittable Routing Games (Q3449452) (← links)
- Cooperative networks games with elastic demands (Q3515388) (← links)
- A Survey of Uniqueness Results for Selfish Routing (Q3614959) (← links)
- Management of Variable Data Streams in Networks (Q3637322) (← links)
- Network design problem with congestion effects: A case of bilevel programming (Q3741367) (← links)
- Load Balancing Congestion Games and Their Asymptotic Behavior (Q4607260) (← links)
- NASH EQUILIBRIA IN LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS (Q4797295) (← links)
- Dynamic Atomic Congestion Games with Seasonal Flows (Q4969328) (← links)
- Minimal-time mean field games (Q4973288) (← links)