Pages that link to "Item:Q5554806"
From MaRDI portal
The following pages link to Über ein Paradoxon aus der Verkehrsplanung (Q5554806):
Displayed 50 items.
- Braess's paradox for flows over time (Q372993) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Detecting Braess paradox based on stable dynamics in general congested transportation networks (Q542093) (← links)
- Finding the \(\varepsilon\)-user equilibrium solution using an augmented Frank-Wolfe algorithm (Q613562) (← links)
- The deregulated electricity market viewed as a bilevel programming problem (Q811888) (← links)
- The no-wait flow-shop paradox (Q813966) (← links)
- Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems (Q836011) (← links)
- Competitive online multicommodity routing (Q839644) (← links)
- Maximum performance at minimum cost in network synchronization (Q858510) (← links)
- Optimal fleet allocation of freeway service patrols (Q862479) (← links)
- Network topology and the efficiency of equilibrium (Q863283) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- A paradox in a queueing network with state-dependent routing and loss (Q933905) (← links)
- A new model for selfish routing (Q952441) (← links)
- Markov chain methods for analyzing urban networks (Q960151) (← links)
- Sensitivity of Wardrop equilibria (Q987396) (← links)
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox (Q1007778) (← links)
- Efficient graph topologies in network routing games (Q1021587) (← links)
- Network architecture and traffic flows: Experiments on the Pigou-Knight-Downs and Braess paradoxes (Q1021602) (← links)
- Sensitivity analysis of the combined travel demand model with applications (Q1042076) (← links)
- On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks (Q1044153) (← links)
- Topological-based bottleneck analysis and improvement strategies for traffic networks (Q1047391) (← links)
- Formulation, stability, and computation of traffic network equilibria as projected dynamical systems (Q1379961) (← links)
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. (Q1400339) (← links)
- A multiclass, multicriteria traffic network equilibrium model (Q1585821) (← links)
- Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values (Q1608406) (← links)
- An optimum link improvement model with a computer algorithm (Q1823842) (← links)
- Simultaneous departure time/route choices in queuing networks and a novel paradox (Q2379706) (← links)
- A unified network performance measure with importance identification and the ranking of network components (Q2465572) (← links)
- The internet, evolutionary variational inequalities, and the time-dependent Braess paradox (Q2468772) (← links)
- Using mixed-integer programming to solve power grid blackout problems (Q2471280) (← links)
- A network efficiency measure with application to critical infrastructure networks (Q2481096) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- A survey on networking games in telecommunications (Q2567161) (← links)
- A paradox in optimal flow control of \(M/M/n\) queues (Q2567166) (← links)
- The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria (Q2572896) (← links)
- Forecasting travel on congested urban transportation networks: Review and prospects for network equilibrium models (Q2642505) (← links)
- A Google-like model of road network dynamics and its application to regulation and control (Q3015166) (← links)
- Public congestion network situations and related games (Q3057160) (← links)
- Braess's Paradox in large random graphs (Q3061184) (← links)
- Sensitivity analysis for the asymmetric network equilibrium problem (Q3320098) (← links)
- Multi-product supply chain horizontal network integration: models, theory, and computational results (Q3566448) (← links)
- When Ignorance Helps: Graphical Multicast Cost Sharing Games (Q3599119) (← links)
- A relative total cost index for the evaluation of transportation network robustness in the presence of degradable links and alternative travel behavior (Q3601203) (← links)
- Traffic Networks and Flows over Time (Q3637317) (← links)
- Models of Non-atomic Congestion Games – From Unicast to Multicast Routing (Q3637323) (← links)
- The Braess paradox (Q3922499) (← links)
- A Paradox for Admission Control of Multiclass Queueing Network with Differentiated Service (Q5443734) (← links)
- Nonadaptive Selfish Routing with Online Demands (Q5458504) (← links)