A game-theoretic algorithm for non-linear single-path routing problems

DOI10.1016/j.endm.2016.03.011zbMath1351.90032OpenAlexW2395154475MaRDI QIDQ325393

Olivier Brun, Josselin Vallet, Balakrishna J. Prabhu

Publication date: 18 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.03.011

zbMATH Keywords

game theorynonlinear programmingbest responsesingle-path routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Applications of game theory (91A80) Transportation, logistics and supply chain management (90B06)

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for nonlinear optimization problems with binary variables
• The quadratic assignment problem. Theory and algorithms
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• The Price of Routing Unsplittable Flow

This page was built for publication: A game-theoretic algorithm for non-linear single-path routing problems