{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:03:24Z","timestamp":1760241804887,"version":"build-2065373602"},"reference-count":41,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T00:00:00Z","timestamp":1534982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>This paper presents an analysis of the effects of cognitive agents employing selfish routing behavior in traffic networks with linear latency functions. Selfish routing occurs when each agent traveling on a network acts in a purely selfish manner, therefore the Braess Paradox is likely to occur. The Braess Paradox describes a situation where an additional edge with positive capacity is added to a given network, which leads to higher total system delay. By applying the concept of cognitive agents, each agent is able to make a range of non-selfish and selfish decisions. In addition, each agent has to cope with uncertainty in terms of travel time information associated with the traffic system, a factor in real-world traffic networks. This paper evaluates the influence of travel time uncertainty, and possible non-selfish decisions of the agents on overall network delay. The results indicate that both non-selfish behavior and uncertainty have an influence on overall travel delay. In addition, understanding the influence of cognitive agents on delay can help to better plan and influence traffic flows resulting in \u201ccloser to optimal\u201d flows involving overall lower delays.<\/jats:p>","DOI":"10.3390\/ijgi7090345","type":"journal-article","created":{"date-parts":[[2018,8,24]],"date-time":"2018-08-24T03:42:31Z","timestamp":1535082151000},"page":"345","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shortest Paths from a Group Perspective\u2014A Note on Selfish Routing Games with Cognitive Agents"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3212-8864","authenticated-orcid":false,"given":"Johannes","family":"Scholz","sequence":"first","affiliation":[{"name":"Research Group Geoinformation, Institute of Geodesy, Graz University of Technology, A-8010 Graz, Austria"}]},{"given":"Richard L.","family":"Church","sequence":"additional","affiliation":[{"name":"Department of Geography, University of California, Santa Barbara, Santa Barbara, CA 93106, USA"}]}],"member":"1968","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Shah, P., and Miyake, A. (2005). Navigation. The Cambridge Handbook of Visuospatial Thinking, Cambridge University Press.","DOI":"10.1017\/CBO9780511610448"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1287\/opre.33.3.696","article-title":"A note on the stochastic shortest route problem","volume":"33","author":"Kamburowski","year":"1985","journal-title":"Oper. Res."},{"key":"ref_3","first-page":"1","article-title":"Fastest paths in time-dependent networks for IVHS application","volume":"1","author":"Kaufman","year":"1993","journal-title":"IVHS J."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1002\/net.3230210304","article-title":"Minimum weight paths in time-dependent network","volume":"21","author":"Orda","year":"1991","journal-title":"Networks"},{"key":"ref_5","first-page":"295","article-title":"Time-dependent shortest path algorithm for realtime intelligent vehicle highway system applications","volume":"1408","author":"Ziliaskopoulos","year":"1993","journal-title":"Transp. Res. Rec."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., and Qin, L. (2008, January 25\u201329). Finding time-dependent shortest paths over large graphs. Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, Nantes, France.","DOI":"10.1145\/1353343.1353371"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Roughgarden, T. (2005). Selfish Routing and the Price of Anarchy, The MIT Press.","DOI":"10.21236\/ADA637949"},{"key":"ref_8","first-page":"258","article-title":"Ueber ein Paradoxon aus der Verkehrsplanung","volume":"12","author":"Braess","year":"1968","journal-title":"Unternehmensforschung"},{"key":"ref_9","unstructured":"Wazestats.com (2018, August 22). Maximum of Wazers per Million Citizens at 2018\/05\/02. Available online: http:\/\/ http:\/\/wazestats.com."},{"key":"ref_10","first-page":"1335","article-title":"Information provision and driver compliance to advanced traveller information system application: Case study on the interaction between variable message sign and other sources of traffic updates in Calgary, Canada","volume":"38","author":"Kattan","year":"2011","journal-title":"Can. J. Civ. Eng."},{"key":"ref_11","unstructured":"Meyer, M.D., and Miller, E.J. (2001). Urban Transportation Planning: A Decision-Oriented Approach, McGraw-Hill."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"McNally, M.G. (2007). The Four-Step Model. Handbook of Transport Modelling, Emerald Insight Publishing.","DOI":"10.1108\/9780857245670-003"},{"key":"ref_13","first-page":"325","article-title":"Road paper. Some theoretical aspects of road traffic research","volume":"Volume 1","author":"Wardrop","year":"1952","journal-title":"ICE Proceedings: Engineering Divisions"},{"key":"ref_14","unstructured":"Myerson, R.B. (1991). Game Theory: Analysis of Conflict, Harvard University Press."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","article-title":"Non-Cooperative Games","volume":"54","author":"Nash","year":"1951","journal-title":"Ann. Math."},{"key":"ref_16","unstructured":"Ford, L.R., and Fulkerson, D.R. (2010). Flows in Networks, Princeton University Press."},{"key":"ref_17","unstructured":"Korte, B., Lovasz, L., Pr\u00f6mel, H.J., and Schrijver, A. (1990). Network Flow Algorithms. Paths, Flows and VLSI-Layout, Springer Verlag."},{"key":"ref_18","unstructured":"Tucker, A.W. (2018, August 22). A Two-Person Dilemma. Unpublished Notes. Available online: http:\/\/www.rasmusen.org\/x\/images\/pd.jpg."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C. (2001, January 6\u20138). Algorithms, games, and the internet. Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, Crete, Greece.","DOI":"10.1145\/380752.380883"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.trc.2017.12.011","article-title":"Mitigating the impact of selfish routing: An optimal-ratio control scheme (ORCS) inspired by autonomous driving","volume":"87","author":"Zhang","year":"2018","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s00453-013-9753-8","article-title":"Improving the price of anarchy for selfish routing via coordination mechanisms","volume":"69","author":"Christodoulou","year":"2014","journal-title":"Algorithmica"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Hasan, M.R., Bazzan, A.L., Friedman, E., and Raja, A. (2016, January 1\u20134). A multiagent solution to overcome selfish routing in transportation networks. Proceedings of the 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC), Rio de Janeiro, Brazil.","DOI":"10.1109\/ITSC.2016.7795856"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Cole, R., Lianeas, T., and Nikolova, E. (2018, January 13\u201319). When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing?. Proceedings of the IJCAI, Stockholm, Sweden.","DOI":"10.24963\/ijcai.2018\/24"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Zhang, W., He, Z., Guan, W., and Ma, R. (2017). Selfish routing equilibrium in stochastic traffic network: A probability-dominant description. PLoS ONE, 12.","DOI":"10.1371\/journal.pone.0183135"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Friedman, E.J. (2004, January 14\u201317). Genericity and congestion control in selfish routing. Proceedings of the 43rd IEEE Conference on Decision and Control, Nassau, Bahamas.","DOI":"10.1109\/CDC.2004.1429524"},{"key":"ref_26","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"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01589354","article-title":"The Braess Paradox","volume":"20","author":"Frank","year":"1968","journal-title":"Math. Program."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/trsc.17.3.301","article-title":"The prevalence of Braess\u2019 paradox","volume":"17","author":"Steinberg","year":"1983","journal-title":"Transp. Sci."},{"key":"ref_29","unstructured":"Beckmann, M., McGuire, C., and Winsten, C.B. (1956). Studies in the Economics of Transportation, Yale University Press."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Frank, A.U., Bittner, S., and Raubal, M. (2001). Spatial and cognitive simulation with multi-agent systems. Spatial Information Theory, Springer.","DOI":"10.1007\/3-540-45424-1_9"},{"key":"ref_31","unstructured":"Russel, S., and Norvig, P. (1995). Artificial Intelligence\u2014A Modern Approach, Prentice Hall International, Inc."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Raubal, M., and Worboys, M. (1999). A formal model of the process of wayfinding in built environments. Spatial Information Theory. Cognitive and Computational Foundations of Geographic Information Science, Springer.","DOI":"10.1007\/3-540-48384-5_25"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1068\/b250895","article-title":"Comparing the complexity of wayfinding tasks in built environments","volume":"25","author":"Raubal","year":"1998","journal-title":"Environ. Plan. B"},{"key":"ref_34","first-page":"15","article-title":"Uncertainty in Wayfinding: A Conceptual Framework and Agent-Based Model","volume":"Volume 86","author":"Clementini","year":"2017","journal-title":"Proceedings of the 13th International Conference on Spatial Information Theory (COSIT 2017)"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0191-2615(03)00007-9","article-title":"Pedestrian route-choice and activity scheduling theory and models","volume":"38","author":"Hoogendoorn","year":"2004","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.jcss.2005.09.010","article-title":"How much can taxes help selfish routing?","volume":"72","author":"Cole","year":"2006","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_37","unstructured":"Abdalla, A., and Frank, A.U. (2011, January 12). Personal geographic information management. Proceedings of the Workshop on Cognitive Engineering for Mobile GIS (CEUR Workshop Proceedings), Belfast, ME, USA."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/2194-3206-1-3","article-title":"Complex adaptive systems modeling with Repast Simphony","volume":"1","author":"North","year":"2013","journal-title":"Complex Adapt. Syst. Model."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., and Roughgarden, T. (2003). Pricing Networks with Selfish Routing, Department of Computer Science, Cornell University.","DOI":"10.21236\/ADA637950"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1017\/S0140525X12000477","article-title":"Whatever next? Predictive brains, situated agents, and the future of cognitive science","volume":"36","author":"Clark","year":"2013","journal-title":"Behav. Brain Sci."},{"key":"ref_41","unstructured":"Hawkins, J., and Blakeslee, S. (2007). On Intelligence: How a New Understanding of the Brain Will Lead to the Creation of Truly Intelligent Machines, MacMillan."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/7\/9\/345\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:20:42Z","timestamp":1760196042000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/7\/9\/345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,23]]},"references-count":41,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["ijgi7090345"],"URL":"https:\/\/doi.org\/10.3390\/ijgi7090345","relation":{},"ISSN":["2220-9964"],"issn-type":[{"type":"electronic","value":"2220-9964"}],"subject":[],"published":{"date-parts":[[2018,8,23]]}}}