Pages that link to "Item:Q442104"
From MaRDI portal
The following pages link to Efficient methods for selfish network design (Q442104):
Displaying 16 items.
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Paradoxes in social networks with multiple products (Q516241) (← links)
- A selfish routing based network improvement problem (Q545450) (← links)
- Selfish network creation with non-uniform edge cost (Q681862) (← links)
- Inefficiencies in network models: a graph-theoretic perspective (Q1685026) (← links)
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106) (← links)
- Escaping Braess's paradox through approximate Caratheodory's theorem (Q2094366) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- (Q2934596) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Near-optimal network design with selfish agents (Q3581253) (← links)
- On the Hardness of Network Design for Bottleneck Routing Games (Q4910942) (← links)
- Automata, Languages and Programming (Q5716801) (← links)