{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T07:08:32Z","timestamp":1772262512749,"version":"3.50.1"},"reference-count":28,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p> Over the years, travelers are increasingly relying on navigation services to inform their route choices and save time. How much value\u2014in terms of saved time\u2014can these services indeed provide to their users? The answer is not as simple as one may think because the value of traffic information not only depends on its accuracy, but also on how widely it is shared among travelers. For instance, information on an incident has the highest value for a traveler when the traveler is the only person who knows about it and takes a detour. However, this information becomes less valuable when it is shared with more travelers, who may take the same detour and cause congestion. Our work uses a game-theoretic approach to analyze how the relative value of information provided by different navigation services changes with their market share and how travelers may choose from different available services. <\/jats:p>","DOI":"10.1287\/opre.2020.1999","type":"journal-article","created":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T16:50:43Z","timestamp":1607705443000},"page":"148-163","source":"Crossref","is-referenced-by-count":47,"title":["Value of Information in Bayesian Routing Games"],"prefix":"10.1287","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5334-4163","authenticated-orcid":false,"given":"Manxi","family":"Wu","sequence":"first","affiliation":[{"name":"Institute for Data, Systems, and Society, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1554-015X","authenticated-orcid":false,"given":"Saurabh","family":"Amin","sequence":"additional","affiliation":[{"name":"Laboratory of Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1827-1285","authenticated-orcid":false,"given":"Asuman E.","family":"Ozdaglar","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139"}]}],"member":"109","reference":[{"key":"B1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0231"},{"key":"B2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1712"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2607(91)90146-H"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2607(91)90142-D"},{"key":"B5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85256-5_19"},{"key":"B6","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729032"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0383"},{"key":"B8","doi-asserted-by":"crossref","unstructured":"Fiacco AV (2009) Sensitivity and stability in NLP: Continuity and differential stability. Floudas C, Pardalos P, eds. Encyclopedia of Optimization (Springer, Boston), 3467\u20133471.","DOI":"10.1007\/978-0-387-74759-0_595"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00938592"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0651"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1257\/000282802762024610"},{"issue":"4","key":"B13","first-page":"561","volume":"61","author":"Hirshleifer J","year":"1971","journal-title":"Amer. Econom. Rev."},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1257\/aer.101.6.2590"},{"key":"B15","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2018.04.003"},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.3982\/ECTA13251"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_38"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmateco.2005.09.002"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2607(91)90145-G"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0027"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"B22","doi-asserted-by":"publisher","DOI":"10.1016\/0899-8256(91)90033-B"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1246"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121219"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2003.06.004"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1006\/jeth.2000.2696"},{"key":"B28","doi-asserted-by":"crossref","unstructured":"Tardos E, Wexler T (2007) Network formation games and the potential function method. Nisan N, Roughgarden T, Tardos E, Vazirani VV, eds. Algorithmic Game Theory (Cambridge University Press, New York), 487\u2013516.","DOI":"10.1017\/CBO9780511800481.021"},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2012.11.009"},{"key":"B30","unstructured":"Wu M, Liu J, Amin S (2017) Informational aspects in a class of Bayesian congestion games. 2017 Amer. Control Conference (ACC) (IEEE, Piscataway, NJ), 3650\u20133657."}],"container-title":["Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/opre.2020.1999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T20:15:11Z","timestamp":1680466511000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/opre.2020.1999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1287\/opre.2020.1999"],"URL":"https:\/\/doi.org\/10.1287\/opre.2020.1999","relation":{},"ISSN":["0030-364X","1526-5463"],"issn-type":[{"value":"0030-364X","type":"print"},{"value":"1526-5463","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}