Temporal Congestion Games

Please enable javascript in your browser.

Mehr, Mehran | 2012

1145 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 43693 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Ghodsi, Mohammad
Abstract:
We consider a special class of Congestion Games enhanced with a notion of time.Network Routing problems, such as road traffic networks, computer neworks, and evacuation problems are some applications of this class of games. Two subclasses of these games, namely atomic and non-atomic is considered in this article, both of them introduced in 2009. Some of the existing results are Nash equilibria existence proof for “single-source single-sink” case, and a mechanism for improving price of anarchy in the non-atomic subclass. There are also some results in the atomic subclass of this game.We extend both models of atomic and non-atomic subclasses to “multi-source,multi-sink” configurations. We call these configurations Transshipment as a shorthand for temporal “multi-source, multi-sink” routing. These extended models increase descriptive power of temporal congestion games. We prove existence of Nash equilibria in transshipment case of the non-atomic subclass and show some properties of Nash equilibria in this case. Similar results are presented for the atomic subclass
Keywords:
Coordination Mechanism ; Nash Equilibrium Point ; Congestion Game ; Dynamic Routing