Pages that link to "Item:Q2496322"
From MaRDI portal
The following pages link to On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322):
Displaying 47 items.
- On the Braess paradox with nonlinear dynamics and control theory (Q255086) (← links)
- Allocation of flows in closed bipartite queueing networks (Q323531) (← links)
- Network design to anticipate selfish evacuation routing (Q339932) (← links)
- Braess's paradox for flows over time (Q372993) (← links)
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox (Q453657) (← links)
- Network congestion control with Markovian multipath routing (Q463729) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- Detecting Braess paradox based on stable dynamics in general congested transportation networks (Q542093) (← links)
- A selfish routing based network improvement problem (Q545450) (← links)
- Optimal routing for multiclass networks (Q666417) (← links)
- Stackelberg thresholds in network routing games or the value of altruism (Q834861) (← links)
- Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems (Q836011) (← links)
- Sensitivity of Wardrop equilibria (Q987396) (← links)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- Inefficiencies in network models: a graph-theoretic perspective (Q1685026) (← links)
- The impact of worst-case deviations in non-atomic network routing games (Q1733381) (← links)
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106) (← links)
- Locating inefficient links in a large-scale transportation network (Q1783282) (← links)
- Quantum games: a review of the history, current state, and interpretation (Q1994770) (← links)
- Polynomial recognition of vulnerable multi-commodities (Q2094357) (← links)
- Escaping Braess's paradox through approximate Caratheodory's theorem (Q2094366) (← links)
- Inefficiency in stochastic queueing systems with strategic customers (Q2239838) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Depletable channels: dynamics, behaviour, and efficiency in network design (Q2422775) (← links)
- Negative prices in network pricing games (Q2670481) (← links)
- Modifying link capacity to avoid Braess paradox considering elastic demand (Q2675881) (← links)
- The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games (Q2819453) (← links)
- Braess's Paradox in large random graphs (Q3061184) (← links)
- Braess's paradox in expanders (Q3145837) (← links)
- Excluding Braess’s Paradox in Nonatomic Selfish Routing (Q3449597) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- On the Hardness of Network Design for Bottleneck Routing Games (Q4910942) (← links)
- Dynamic Atomic Congestion Games with Seasonal Flows (Q4969328) (← links)
- Informational Braess’ Paradox: The Effect of Information on Traffic Congestion (Q4971386) (← links)
- Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators (Q5031023) (← links)
- Risk-Averse Selfish Routing (Q5219707) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q5348461) (← links)
- Sensitivity of Wardrop Equilibria (Q5459981) (← links)
- Automata, Languages and Programming (Q5716801) (← links)
- Braess' paradox: A cooperative game‐theoretic point of view (Q6065828) (← links)
- A new scenario for Braess's paradox in power grids (Q6570800) (← links)