The efficiency of greedy best response algorithm in road traffic assignment
by Lahna Idres; Mohammed Said Radjef
International Journal of Mathematics in Operational Research (IJMOR), Vol. 15, No. 3, 2019

Abstract: In this work, we investigate the problem of the integer road traffic assignment. So, we model the interaction among the road users sharing the same origin-destination pair, as a symmetric network congestion game. We focus on Rosenthal's results to guarantee the existence of a pure Nash equilibrium (PNE). Then, we study the behaviour of an algorithm based on greedy best response (GBR) in finding PNE. In previous studies, the efficiency of GBR to compute a PNE of a symmetric network congestion game in series-parallel networks is proved. In our work, another approach is used to demonstrate its efficiency in more general networks. It is shown that the non-series parallel networks can be classed into two types. The conditions that make GBR succeeds for each type is then drawn. The advantage of GBR-algorithm is that provides a better approximation of the equilibrate assignment, since it is integer.

Online publication date: Fri, 06-Sep-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com