The traffic assignment problem (TAP) is one of the steps in the four-step transportation planning process and involves assigning travelers to different routes. This assignment is done based on the the user equilibrium (UE) principle according to which 'All used routes between an origin-destination (OD) pair are assumed to have equal and minimal travel times.' This principle assumes travelers selfishly choose routes so as to minimize their travel time. The TAP has also been studied by economists, particularly in the field of game theory, due to the close resemblance of the UE principle to the concept of Nash Equilibrium (NE). In general, a game is modeled using three components: a set of players, their actions and their utility functions or payoffs. The TAP is modeled as a non-cooperative game and the NE is defined as a state in which no player can benefit by deviating from his/her current action. The games used to model traffic are also known as network or congestion games.
Game theory and Traffic Assignment
2013
46 pages
Report
No indication
English
Transportation & Traffic Planning , Transportation , Road Transportation , Operations Research , Traffic control , Transportation planning , Game theory , Transportation networks , Travel time , Algorithms , Convergence , Economic analysis , Equilibrium , Routing , Traffic congestion , Traffic assignment problem(TAP)
Risk-averse user equilibrium traffic assignment: an application of game theory
Online Contents | 2002
|Risk Averseness in User Equilibrium Traffic Assignment: An Application of Game Theory
British Library Conference Proceedings | 2000
|Traffic Assignment Models and Microeconomic Theory
British Library Conference Proceedings | 2005
|Feedback control theory for dynamic traffic assignment
TIBKAT | 1999
|