Paradoxes in a multi-criteria routing game

DOI10.1007/978-3-319-67540-4_15zbMATH Open1375.91041OpenAlexW2754584097MaRDI QIDQ4588271FDOQ4588271

Authors: Amina Boukoftane, Majed Haddad, Nadia Oukid, Eitan Altman 

Publication date: 1 November 2017

Published in: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01535718/file/s3.pdf

Recommendations

• Non-cooperative routing in loss networks
• scientific article; zbMATH DE number 1908192
• Avoiding paradoxes in multi-agent competitive routing.
• Braess paradox and properties of Wardrop equilibrium in some multiservice networks
• Tradeoffs and average-case equilibria in selfish routing

zbMATH Keywords

Nash equilibriumparadoxprice of anarchymulti-objective problemrouting gamelossy links

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Games involving graphs (91A43)

Cited In (4)

• Avoiding paradoxes in multi-agent competitive routing.
• On the core of routing games
• Title not available (Why is that?)
• Resilience of routing in parallel link networks

This page was built for publication: Paradoxes in a multi-criteria routing game

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