Avoiding paradoxes in multi-agent competitive routing.

DOI10.1016/S1389-1286(03)00231-7zbMath1069.68507MaRDI QIDQ1426527

Eitan Altman, Odile Pourtallier, Rachid El-Azouzi

Publication date: 15 March 2004

Published in: Computer Networks (Search for Journal in Brave)

zbMATH Keywords

decision making

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

The problem of capacity addition in multi-user elastic demand communication networks ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Braess's Paradox in large random graphs ⋮ A Survey of Uniqueness Results for Selfish Routing ⋮ A survey on networking games in telecommunications

This page was built for publication: Avoiding paradoxes in multi-agent competitive routing.