Fictitious play for finding system optimal routings in dynamic traffic networks
We introduce a novel procedure to compute system optimal routings in a dynamic traffic network. Fictitious play is utilized within a game of identical interests wherein vehicles are treated as players with the common payoff of average trip time experienced in the network. This decentralized approach via repeated play of the fictitious game is proven to converge to a local system optimal routing. Results from a large-scale computational test on a real network are presented.
Volume (Year): 34 (2000)
Issue (Month): 2 (February)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Drew Fudenberg & David K. Levine, 1998.
"The Theory of Learning in Games,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262061945.
- Drew Fudenberg & David K. Levine, 1996. "The Theory of Learning in Games," Levine's Working Paper Archive 624, David K. Levine.
- Ran, Bin & Hall, Randolph W. & Boyce, David E., 1996. "A link-based variational inequality model for dynamic departure time/route choice," Transportation Research Part B: Methodological, Elsevier, vol. 30(1), pages 31-46, February.
- Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414.
- Monderer, Dov & Shapley, Lloyd S., 1996. "Fictitious Play Property for Games with Identical Interests," Journal of Economic Theory, Elsevier, vol. 68(1), pages 258-265, January. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:34:y:2000:i:2:p:147-156. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.