Pages that link to "Item:Q3779976"
From MaRDI portal
The following pages link to Multiple Equilibrium Behaviors on Networks (Q3779976):
Displaying 24 items.
- Finite composite games: equilibria and dynamics (Q261241) (← links)
- Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
- Detecting Braess paradox based on stable dynamics in general congested transportation networks (Q542093) (← links)
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS (Q542097) (← links)
- Mixed equilibria with common constraints on transportation networks (Q681457) (← links)
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
- A multiclass, multicriteria logit-based traffic equilibrium assignment model under ATIS (Q853023) (← links)
- Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
- The existence of equivalent mathematical programs for certain mixed equilibrium traffic assignment problems (Q1322145) (← links)
- A differential game approach to the dynamic mixed behavior traffic network equilibrium problem (Q1388933) (← links)
- Optimal design of differentiated credit charging links in mixed-autonomy transportation networks (Q2109642) (← links)
- Local smoothness and the price of anarchy in splittable congestion games (Q2253842) (← links)
- Solving equilibrium problems using extended mathematical programming (Q2293655) (← links)
- A mixed traffic assignment problem and its upper bound of efficiency loss (Q2336305) (← links)
- A Stackelberg game management model of the urban public transport (Q2358879) (← 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)
- A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times (Q2875605) (← links)
- Coalitions in Nonatomic Network Congestion Games (Q2925351) (← links)
- On the Uniqueness of Equilibrium in Atomic Splittable Routing Games (Q3449452) (← links)
- A Survey of Uniqueness Results for Selfish Routing (Q3614959) (← links)
- Dynamic Atomic Congestion Games with Seasonal Flows (Q4969328) (← links)
- Optimal mixed charging schemes for traffic congestion management with subsidy to new energy vehicle users (Q6092495) (← links)
- The price of anarchy in series-parallel network congestion games (Q6120906) (← links)