๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A game theory model of urban public traffic networks

โœ Scribed by B.B. Su; H. Chang; Y.-Z. Chen; D.R. He


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
269 KB
Volume
379
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

โœฆ Synopsis


We have studied urban public traffic networks from the viewpoint of complex networks and game theory. Firstly, we have empirically investigated an urban public traffic network in Beijing in 2003, and obtained its statistical properties. Then a simplified game theory model is proposed for simulating the evolution of the traffic network. The basic idea is that three network manipulators, passengers, an urban public traffic company, and a government traffic management agency, play games in a network evolution process. Each manipulator tries to build the traffic lines to magnify its ''benefit''. Simulation results show a good qualitative agreement with the empirical results.


๐Ÿ“œ SIMILAR VOLUMES


Modelling of urban traffic networks
โœ C.J. Macleod; A.J. Al-Khalili ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science โš– 693 KB
A differential game model of Nash equili
โœ Byung-Wook Wie ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 755 KB

## Abstract This paper considers the problem of the competition among a finite number of players who must transport the fixed volume of traffic on a simple network over a prescribed planning horizon. Each player attempts to minimize his total transportation cost by making simultaneous decisions of

Collaboration networks in a public servi
โœ Barbara Schultz-Jones; Nancy Cheung ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 201 KB

## Abstract We present both researcher and practitioner responses to the results of a 2007 research study originally designed to apply social network theory to the Neighborhood Integrated Service Teams (NIST). The municipal government for the City of Vancouver, British Columbia, Canada designed and

Numerical algorithms for simulations of
โœ G. Bretti; R. Natalini; B. Piccoli ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 158 KB

We introduce a simulation algorithm based on a fluid-dynamic model for traffic flows on road networks, which are considered as graphs composed by arcs that meet at some junctions. The approximation of scalar conservation laws along arcs is made by three velocities Kinetic schemes with suitable bound

Asymptotic limits of a discrete Kinetic
โœ Abdelghani Bellouquid; Marcello Delitala ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

The paper proposes a rigorous method to construct the hyperbolic asymptotic limit of the discrete Kinetic Theory model of vehicular traffic proposed in . A second-order macroscopic model of the Payne-Whitham type is derived and the coefficients of the equations are obtained from the detailed descrip

Towards a Network Theory of Ageing: A Mo
โœ A. Kowald; T.B.L. Kirkwood ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 921 KB

Many different theories of ageing have been proposed, based often on highly specific molecular causes. Recent advances in evolutionary theory support the idea that ageing is caused by progressive accumulation of defects, but indicate that multiple processes are likely to operate in parallel. This ca