Pages that link to "Item:Q5554806"
From MaRDI portal
The following pages link to Über ein Paradoxon aus der Verkehrsplanung (Q5554806):
Displaying 50 items.
- On the Braess paradox with nonlinear dynamics and control theory (Q255086) (← links)
- Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers (Q291314) (← links)
- Measuring the power of soft correlated equilibrium in 2-facility simple non-increasing linear congestion games (Q301158) (← links)
- Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control (Q322922) (← links)
- Network design to anticipate selfish evacuation routing (Q339932) (← links)
- Bio-inspired paradigms in network engineering games (Q351783) (← links)
- Braess's paradox for flows over time (Q372993) (← links)
- Customer equilibrium and optimal strategies in Markovian queues in series (Q378775) (← links)
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- Monotonicity properties of user equilibrium policies for parallel batch systems (Q429998) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Repeated congestion games with bounded rationality (Q444148) (← links)
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox (Q453657) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- Statistical physics of vaccination (Q521790) (← 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)
- Nash equilibria and the price of anarchy for flows over time (Q647485) (← links)
- Mixed equilibria with common constraints on transportation networks (Q681457) (← links)
- Network extension (Q712478) (← links)
- Efficiency and vulnerability analysis for congested networks with random data (Q725887) (← 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)
- Capacitated network design games (Q904684) (← 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)
- Macroscopic modeling and simulations of room evacuation (Q1634551) (← links)
- On the equivalence between SUE and fixed-point states of day-to-day assignment processes with serially-correlated route choice (Q1642953) (← links)
- Probabilistic selfish routing in parallel batch and single-server queues (Q1649977) (← links)
