Escaping Braess's paradox through approximate Caratheodory's theorem
type: Item
instance of: scholarly article
title: Escaping Braess's paradox through approximate Caratheodory's theorem
author: Sotirios Dimos
author: Dimitris Fotakis
author: Thanasis Lianeas
author: Kyriakos Sergis
published in: Information Processing Letters
publication date: 2022-10-28T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7609041
zbMATH Keywords: Braess paradox
zbMATH Keywords: congestion games
zbMATH Keywords: selfish routing
zbMATH Keywords: best subnetwork
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2022.106289
OpenAlex ID: W4281632415
Wikidata QID: Q113872245
cites work: On sparse approximations to randomized strategies and convex combinations
cites work: Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem
cites work: Random graphs.
cites work: Über ein Paradoxon aus der Verkehrsplanung
cites work: Network characterizations for excluding Braess's paradox
cites work: Braess's paradox in expanders
cites work: Sensitivity of Wardrop equilibria
cites work: Resolving Braess's paradox in random networks
cites work: Efficient methods for selfish network design
cites work: Matroids Are Immune to Braess’ Paradox
cites work: Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids
cites work: Q3533739
cites work: Congestion games with player-specific payoff functions
cites work: On the severity of Braess's paradox: designing networks for selfish users is hard
cites work: BRAESS' PARADOX IN A TWO-TERMINAL TRANSPORTATION NETWORK
cites work: Braess's Paradox in large random graphs
DOI: 10.1016/J.IPL.2022.106289
description: scientific article; zbMATH DE number 7609041