A Game-theoretic Algorithm for Non-linear Single-Path Routing Problems

Abstract

This paper is devoted to non-linear single path routing problems, which are known to be NP-hard even in the simplest cases. We propose a Best Response algorithm, based on Game Theory, providing single-path routings with modest relative errors with respect to optimal solutions, while being several orders of magnitude faster than existing techniques.

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

“…This is an extended version of the paper A game‐theoretic algorithm for non‐linear single‐path routing problems” that appeared in the Proceedings of INOC 2015 . The work of the third author was carried out while he was a doctoral student at LAAS.…”