Metraipolis › archive › dc_0493e55af331
Braess' Paradox in Uniform Affine Grid Networks — arXiv:2608.28938
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.28938
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T09:30:55.784Z
- SHA-256 of the archived text
19eeeb88bfc47d5c8d3dd7fd80f9bd8601c568519d47d999f158a5d9125325ab- Stable URL of this page
https://metraipolis.com/documento/dc_0493e55af331
How to cite
Braess' Paradox in Uniform Affine Grid Networks — arXiv:2608.28938 — arXiv (en), https://arxiv.org/abs/2608.28938 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0493e55af331 (Metraipolis archive dc_0493e55af331, sha256 19eeeb88bfc47d5c8d3dd7fd80f9bd8601c568519d47d999f158a5d9125325ab)
BibTeX
@misc{dc0493e55af331,
title = {Braess' Paradox in Uniform Affine Grid Networks — arXiv:2608.28938},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.28938},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0493e55af331; sha256 19eeeb88bfc47d5c8d3dd7fd80f9bd8601c568519d47d999f158a5d9125325ab},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28938. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Braess' Paradox is the phenomenon in which adding an edge to a congestion network increases total travel time. We study the paradox in directed rectangular grids where every edge shares the latency function $\ell(x)=ax+b$ and an added chord has latency $\ell_{*}(x) = cx+d$, where $a > 0$ and $b,c,d \ge 0$. Using an analogy with electrical networks, we bound the change in total travel time. We then give a necessary and sufficient condition for a chord to induce the paradox for some choice of nonnegative coefficients and compute the exact proportion of such chords in all grids with dimensions at most $100$. Such chords are scarce, and the fraction is maximized near an aspect ratio of $2:1$. We then improve the established $4/3$ upper bound on the Braess Ratio to one depending only on the grid dimensions, approaching $1.207$ on squares and $4/3$ on thin grids. Finally, we prove any ratio-maximizing chord must have zero latency.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.28938 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T09:02:28.813Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).