DocumentCode :
2220331
Title :
Fair policies for travel on neighborhood streets
Author :
Chawathe, Sudarshan S.
Author_Institution :
Dept. of Comput. Sci., Maine Univ., Orono, ME, USA
fYear :
2005
fDate :
13-15 Sept. 2005
Firstpage :
1027
Lastpage :
1032
Abstract :
The residents of each street in a neighborhood can improve their travel times by forming agreements with the residents of other streets to permit mutual thoroughfare. However, this benefit comes with the cost of additional neighborhood traffic. The key problem addressed by this paper is that of determining a policy that is fair to each street´s residents´ desires to minimize their travel time by using neighborhood streets while also minimizing traffic on their street. We model this problem using a street graph and apply game theoretic methods in order to characterize solutions.
Keywords :
game theory; graph theory; road traffic; game theoretic methods; neighborhood streets; neighborhood traffic; street graph; Aggregates; Cities and towns; Computer science; Costs; Engineering profession; Game theory; Network topology; Road transportation; Telecommunication traffic; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Transportation Systems, 2005. Proceedings. 2005 IEEE
Print_ISBN :
0-7803-9215-9
Type :
conf
DOI :
10.1109/ITSC.2005.1520192
Filename :
1520192
Link To Document :
بازگشت