A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Fair policies for travel on neighborhood streets
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.
Fair policies for travel on neighborhood streets
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.
Fair policies for travel on neighborhood streets
Chawathe, S.S. (author)
2005-01-01
196876 byte
Conference paper
Electronic Resource
English
Fair Policies for Travel on Neighborhood Streets
| British Library Conference Proceedings | 2005
Complete Streets Policies and Public Transit
| British Library Online Contents | 2016
Reviews - Community Development and Neighborhood Planning - Streets and Patterns
| Online Contents | 2007
Streets of Hope: The Fall and Rise of an Urban Neighborhood
| Online Contents | 1996
Learning from Main Streets A machine learning approach identifying neighborhood commercial districts
| British Library Conference Proceedings | 2006