原文传递
Game theory and Traffic Assignment.
| 题名： | Game theory and Traffic Assignment. |
| 作者： | Boyles, S. D.; Rambha, T. |
| 关键词： | Algorithms; Convergence; Economic Analysis; Equilibrium; Game Theory; Routing; Traffic Assignment Problem(tap); Traffic Congestion; Traffic Control; Transportation Networks; Transportation Planning; T |
| 摘要： | 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-THEORETIC FORMULATIONS OF INTERACTION BETWEEN DYNAMIC TRAFFIC CONTROL AND DYNAMIC TRAFFIC ASSIGNMENT.
- Game-Theoretic Analysis of Dynamic Traffic Equilibria.
- A new heuristic algorithm for traffic assignment based on macroscopic traffic simulation.
- VISION FOR TMC APPLICATION OF DYNAMIC TRAFFIC ASSIGNMENT.
- Game-Theoretic Analysis of Dynamic Traffic Equilibria
- Regional Traffic Simulation Assignment Model for Evaluation of Transit Performance and Asset Utilization.
检索历史
应用推荐
