{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T17:43:24Z","timestamp":1785606204055,"version":"3.56.0"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,3,13]],"date-time":"2027-03-13T00:00:00Z","timestamp":1804896000000},"content-version":"am","delay-in-days":255,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2030624"],"award-info":[{"award-number":["CNS-2030624"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-2319995"],"award-info":[{"award-number":["ECCS-2319995"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-2335969"],"award-info":[{"award-number":["DGE-2335969"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pervasive and Mobile Computing"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.pmcj.2026.102199","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:32:31Z","timestamp":1773189151000},"page":"102199","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A trust-aware Stackelberg routing algorithm to mitigate traffic congestion"],"prefix":"10.1016","volume":"119","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5124-3764","authenticated-orcid":false,"given":"Doris E.M.","family":"Brown","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Venkata Sriram Siddhardh","family":"Nadendla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sajal K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.pmcj.2026.102199_b1","article-title":"Your navigation app is making traffic unmanageable","volume":"19","author":"Macfarlane","year":"2019","journal-title":"IEEE Spectr."},{"key":"10.1016\/j.pmcj.2026.102199_b2","series-title":"Selfish Routing and the Price of Anarchy","author":"Roughgarden","year":"2005"},{"issue":"2","key":"10.1016\/j.pmcj.2026.102199_b3","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","article-title":"How bad is selfish routing?","volume":"49","author":"Roughgarden","year":"2002","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/j.pmcj.2026.102199_b4","first-page":"325","article-title":"Road paper. Some theoretical aspects of road traffic research","volume":"1","author":"Wardrop","year":"1952","journal-title":"Proc. Inst. Civ. Eng."},{"key":"10.1016\/j.pmcj.2026.102199_b5","series-title":"Game Theory for Wireless Communications and Networking","author":"Zhang","year":"2011"},{"key":"10.1016\/j.pmcj.2026.102199_b6","series-title":"Theory of Games and Economic Behavior","author":"Von Neumann","year":"1944"},{"key":"10.1016\/j.pmcj.2026.102199_b7","series-title":"Evolutionary Game Theory","author":"Alexander","year":"2002"},{"issue":"2","key":"10.1016\/j.pmcj.2026.102199_b8","doi-asserted-by":"crossref","DOI":"10.2307\/1969529","article-title":"Non-cooperative games","volume":"54","author":"Nash","year":"1951","journal-title":"Ann. Math."},{"key":"10.1016\/j.pmcj.2026.102199_b9","doi-asserted-by":"crossref","first-page":"103862","DOI":"10.1109\/ACCESS.2021.3097942","article-title":"Game theory based congestion control for routing in wireless sensor networks","volume":"9","author":"Hu","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.pmcj.2026.102199_b10","series-title":"2019 IEEE Intelligent Transportation Systems Conference","first-page":"987","article-title":"A multi-vehicle cooperative routing method based on evolutionary game theory","author":"Lu","year":"2019"},{"key":"10.1016\/j.pmcj.2026.102199_b11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.comnet.2018.03.032","article-title":"An evolutionary routing game for energy balance in wireless sensor networks","volume":"138","author":"Attiah","year":"2018","journal-title":"Comput. Netw."},{"issue":"1","key":"10.1016\/j.pmcj.2026.102199_b12","article-title":"Hybrid PSO and evolutionary game theory protocol for clustering and routing in wireless sensor network","volume":"2020","author":"Song","year":"2020","journal-title":"J. Sensors"},{"key":"10.1016\/j.pmcj.2026.102199_b13","doi-asserted-by":"crossref","unstructured":"T. Roughgarden, Stackelberg scheduling strategies, in: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, 2001, pp. 104\u2013113.","DOI":"10.1145\/380752.380783"},{"issue":"1","key":"10.1016\/j.pmcj.2026.102199_b14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","article-title":"A class of games possessing pure-strategy Nash equilibria","volume":"2","author":"Rosenthal","year":"1973","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/j.pmcj.2026.102199_b15","doi-asserted-by":"crossref","unstructured":"M. Gairing, B. Monien, K. Tiemann, Selfish routing with incomplete information, in: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005, pp. 203\u2013212.","DOI":"10.1145\/1073970.1074000"},{"key":"10.1016\/j.pmcj.2026.102199_b16","series-title":"The Impact of Stackelberg Routing in General Networks","author":"Bonifaci","year":"2007"},{"issue":"2","key":"10.1016\/j.pmcj.2026.102199_b17","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.1100.0442","article-title":"Stackelberg routing in arbitrary networks","volume":"35","author":"Bonifaci","year":"2010","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.pmcj.2026.102199_b18","series-title":"2022 American Control Conference","first-page":"4654","article-title":"Stackelberg routing of autonomous cars in mixed-autonomy traffic networks","author":"Kolarich","year":"2022"},{"key":"10.1016\/j.pmcj.2026.102199_b19","first-page":"5252","article-title":"Signaling in Bayesian network congestion games: the subtle power of symmetry","volume":"vol. 35","author":"Castiglioni","year":"2021"},{"key":"10.1016\/j.pmcj.2026.102199_b20","series-title":"2023 62nd IEEE Conference on Decision and Control","first-page":"3945","article-title":"Information design in Bayesian routing games","author":"Cianfanelli","year":"2023"},{"issue":"1","key":"10.1016\/j.pmcj.2026.102199_b21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1109\/90.554730","article-title":"Achieving network optima using stackelberg routing strategies","volume":"5","author":"Korilis","year":"1997","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.pmcj.2026.102199_b22","doi-asserted-by":"crossref","unstructured":"S. Sanga, V.S.S. Nadendla, M. Telukunta, S.K. Das, Strategic Information Design in Selfish Routing with Quantum Response Travelers, in: 2023 IEEE 20th International Conference on Mobile Ad Hoc and Smart Systems, MASS, 2023, pp. 152\u2013160.","DOI":"10.1109\/MASS58611.2023.00026"},{"key":"10.1016\/j.pmcj.2026.102199_b23","first-page":"1","article-title":"Stackelberg routing on parallel transportation networks","author":"Krichene","year":"2017","journal-title":"Handb. Dyn. Game Theory"},{"key":"10.1016\/j.pmcj.2026.102199_b24","doi-asserted-by":"crossref","unstructured":"A.C. Kaporis, P.G. Spirakis, The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions, in: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2006, pp. 19\u201328.","DOI":"10.1145\/1148109.1148113"},{"issue":"4","key":"10.1016\/j.pmcj.2026.102199_b25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2344422.2344426","article-title":"The effectiveness of stackelberg strategies and tolls for network congestion games","volume":"8","author":"Swamy","year":"2012","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.pmcj.2026.102199_b26","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/s00453-007-9018-5","article-title":"Stackelberg strategies for selfish routing in general multicommodity networks","volume":"53","author":"Karakostas","year":"2009","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/j.pmcj.2026.102199_b27","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/TAC.2013.2289709","article-title":"Stackelberg routing on parallel networks with horizontal queues","volume":"59","author":"Krichene","year":"2014","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"10.1016\/j.pmcj.2026.102199_b28","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1109\/TCNS.2016.2619910","article-title":"On social optimal routing under selfish learning","volume":"5","author":"Krichene","year":"2016","journal-title":"IEEE Trans. Control. Netw. Syst."},{"key":"10.1016\/j.pmcj.2026.102199_b29","doi-asserted-by":"crossref","unstructured":"G. Sharon, M. Albert, T. Rambha, S. Boyles, P. Stone, Traffic optimization for a mixture of self-interested and compliant agents, in: Proceedings of the AAAI Conference on Artificial Intelligence, 2018, pp. 1202\u20131209.","DOI":"10.1609\/aaai.v32i1.11444"},{"key":"10.1016\/j.pmcj.2026.102199_b30","series-title":"Transportation Networks","author":"Stabler","year":"2020"},{"key":"10.1016\/j.pmcj.2026.102199_b31","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","article-title":"An overview of bilevel optimization","volume":"153","author":"Colson","year":"2007","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"10.1016\/j.pmcj.2026.102199_b32","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.38.3.556","article-title":"Computational difficulties of bilevel linear programming","volume":"38","author":"Ben-Ayed","year":"1990","journal-title":"Oper. Res."},{"issue":"265","key":"10.1016\/j.pmcj.2026.102199_b33","doi-asserted-by":"crossref","first-page":"116","DOI":"10.2307\/2227641","article-title":"Studies in the economics of transportation","volume":"67","author":"Smeed","year":"1957","journal-title":"Econ. J."},{"issue":"1\u20132","key":"10.1016\/j.pmcj.2026.102199_b34","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","article-title":"An algorithm for quadratic programming","volume":"3","author":"Frank","year":"1956","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/j.pmcj.2026.102199_b35","series-title":"TASR software","author":"Brown","year":"2024"},{"key":"10.1016\/j.pmcj.2026.102199_b36","series-title":"SURTRAC: Scalable urban traffic control","author":"Smith","year":"2013"},{"key":"10.1016\/j.pmcj.2026.102199_b37","series-title":"Smart and scalable urban signal networks: methods and systems for adaptive traffic signal control","author":"Smith","year":"2017"},{"issue":"1","key":"10.1016\/j.pmcj.2026.102199_b38","doi-asserted-by":"crossref","first-page":"10","DOI":"10.3141\/2178-02","article-title":"Heuristic ramp-metering coordination strategy implemented at Monash Freeway, Australia","volume":"2178","author":"Papamichail","year":"2010","journal-title":"Transp. Res. Rec."}],"container-title":["Pervasive and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574119226000404?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574119226000404?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T01:30:30Z","timestamp":1776130230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574119226000404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":38,"alternative-id":["S1574119226000404"],"URL":"https:\/\/doi.org\/10.1016\/j.pmcj.2026.102199","relation":{},"ISSN":["1574-1192"],"issn-type":[{"value":"1574-1192","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A trust-aware Stackelberg routing algorithm to mitigate traffic congestion","name":"articletitle","label":"Article Title"},{"value":"Pervasive and Mobile Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.pmcj.2026.102199","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102199"}}