Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands
Zengzhe Feng,
Ziyou Gao and
Huijun Sun
Transportation Research Part E: Logistics and Transportation Review, 2014, vol. 63, issue C, 31-43
Abstract:
We determine the exact upper bound of the inefficiency of atomic splittable selfish traffic equilibria with elastic travel demand with and without road pricing. In the previous results, only pseudo-approximation bound were obtained for this case. By comparison, we also conclude that the traffic equilibrium with elastic demand may be worse than the corresponding fixed demand case, which implying that the demands’ elastic can have a negative effect on the quality of equilibrium solutions. Finally, we propose a road pricing mechanism. We prove that there are optimal tolls in general network, atomic players and elastic travel demand setting.
Keywords: Nash game; Inefficiency; Traffic equilibria; Elastic demand; Optimal tax (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554514000027
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:63:y:2014:i:c:p:31-43
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
DOI: 10.1016/j.tre.2014.01.001
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().