A penalized best-response algorithm for nonlinear single-path routing problems

DOI10.1002/NET.21720MaRDI QIDQ4565771zbMATH OpenOpenAlexFDO

Authors Olivier Brun, Josselin Vallet, Balakrishna Prabhu

Publication date 13 June 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://hal.laas.fr/hal-01461689/file/camera_ready.pdf

zbMATH Keywords

approximation algorithmbest responsegame theoryNash equilibriumnonlinear programmingsingle-path routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Nonlinear programming (90C30) Noncooperative games (91A10)

Recommendations

• A game-theoretic algorithm for non-linear single-path routing problems
• Routing into two parallel links: Game-theoretic distributed algorithms
• Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions
• Reconciling selfish routing with social good
• Theoretical Computer Science

Cited in

(3)

• A game-theoretic algorithm for non-linear single-path routing problems
• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
• Multicommodity information flow through quantum annealer

This page was built for publication: A penalized best-response algorithm for nonlinear single-path routing problems

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