Escaping Braess's paradox through approximate Caratheodory's theorem

DOI10.1016/J.IPL.2022.106289MaRDI QIDQ2094366zbMATH OpenOpenAlexWikidataFDO

Authors Sotirios Dimos, Dimitris Fotakis, Thanasis Lianeas, Kyriakos Sergis

Publication date 28 October 2022

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2022.106289

zbMATH Keywords

approximation algorithmscongestion gamesselfish routingBraess paradoxbest subnetwork

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Resolving Braess's paradox in random networks
• Resolving Braess's paradox in random networks
• Efficient Methods for Selfish Network Design
• Efficient methods for selfish network design
• On the severity of Braess's paradox: designing networks for selfish users is hard

Cites work

• Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
• BRAESS' PARADOX IN A TWO-TERMINAL TRANSPORTATION NETWORK
• Braess's Paradox in large random graphs
• Braess's paradox in expanders
• Congestion games with player-specific payoff functions
• Efficient methods for selfish network design
• Matroids are immune to Braess' paradox
• Network characterizations for excluding Braess's paradox
• On sparse approximations to randomized strategies and convex combinations
• On the severity of Braess's paradox: designing networks for selfish users is hard
• Random graphs.
• Resolving Braess's paradox in random networks
• Sensitivity analysis for convex separable optimization over integral polymatroids
• Sensitivity of Wardrop equilibria
• The Princeton companion to mathematics.
• Über ein Paradoxon aus der Verkehrsplanung

This page was built for publication: Escaping Braess's paradox through approximate Caratheodory's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2094366)