Matroids Are Immune to Braess’ Paradox
From MaRDI portal
Publication:5359118
DOI10.1287/moor.2016.0825zbMath1380.91034arXiv1504.07545OpenAlexW2963642909MaRDI QIDQ5359118
Satoru Fujishige, Michel X. Goemans, Rico Zenklusen, Tobias Harks, Britta Peis
Publication date: 22 September 2017
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07545
Noncooperative games (91A10) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Uniqueness of equilibria in atomic splittable polymatroid congestion games, Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids, Negative prices in network pricing games, A common generalization of budget games and congestion games, A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs, Network characterizations for excluding Braess's paradox, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, Informational Braess’ Paradox: The Effect of Information on Traffic Congestion, Efficiency of Equilibria in Uniform Matroid Congestion Games, Escaping Braess's paradox through approximate Caratheodory's theorem
