Pages that link to "Item:Q4261298"

The following pages link to Avoiding the Braess paradox in non-cooperative networks (Q4261298):

Displaying 19 items.

• Competitive routing of traffic flows by navigation providers (Q278911) (← links)
• Capacitated network design games (Q904684) (← links)
• Multicriteria network equilibrium modeling with variable weights for decision-making in the Information Age with applications to telecommuting and teleshopping (Q1605215) (← links)
• Probabilistic selfish routing in parallel batch and single-server queues (Q1649977) (← links)
• Locating inefficient links in a large-scale transportation network (Q1783282) (← links)
• The internet, evolutionary variational inequalities, and the time-dependent Braess paradox (Q2468772) (← links)
• The problem of capacity addition in multi-user elastic demand communication networks (Q2474556) (← links)
• On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
• A survey on networking games in telecommunications (Q2567161) (← links)
• A paradox in optimal flow control of \(M/M/n\) queues (Q2567166) (← links)
• Braess's Paradox in large random graphs (Q3061184) (← links)
• Dynamics of a 2D Piecewise Linear Braess Paradox Model: Effect of the Third Partition (Q3457734) (← links)
• A Survey of Uniqueness Results for Selfish Routing (Q3614959) (← links)
• Fragile networks: identifying vulnerabilities and synergies in an uncertain age (Q4918253) (← links)
• Non-Negativity of Information Value in Games, Symmetry and Invariance (Q5232795) (← links)
• Optimal speeds for walking and running, and walking on a moving walkway (Q5246382) (← links)
• Complexity and Approximation of the Continuous Network Design Problem (Q5348461) (← links)
• Computing the Value of Information in Quadratic Stochastic Decision Problems (Q5391899) (← links)
• The price of anarchy is independent of the network topology (Q5917582) (← links)