{"id":"https://openalex.org/W2914851114","doi":"https://doi.org/10.1109/cdc.2018.8618652","title":"Bayesian Congestion Game with Traffic Manager: Binary Signal Case","display_name":"Bayesian Congestion Game with Traffic Manager: Binary Signal Case","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2914851114","doi":"https://doi.org/10.1109/cdc.2018.8618652","mag":"2914851114"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2018.8618652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8618652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001634452","display_name":"Mohammad Hassan Lotfi","orcid":"https://orcid.org/0000-0003-1358-4984"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammad Hassan Lotfi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039201084","display_name":"Richard J. La","orcid":"https://orcid.org/0000-0002-4836-8475"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard J. La","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065643877","display_name":"Nuno C. Martins","orcid":"https://orcid.org/0000-0003-2083-8102"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nuno C. Martins","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001634452"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":1.4681,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.86023272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"327","last_page":"333"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6599264740943909},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.547420859336853},{"id":"https://openalex.org/keywords/bayesian-game","display_name":"Bayesian game","score":0.5238794684410095},{"id":"https://openalex.org/keywords/signal","display_name":"SIGNAL (programming language)","score":0.4813033640384674},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4705812335014343},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.4680713415145874},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4605698883533478},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.44562941789627075},{"id":"https://openalex.org/keywords/traffic-congestion","display_name":"Traffic congestion","score":0.42783018946647644},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.3506593704223633},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3232426047325134},{"id":"https://openalex.org/keywords/repeated-game","display_name":"Repeated game","score":0.19746020436286926},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1457347273826599},{"id":"https://openalex.org/keywords/business","display_name":"Business","score":0.14546364545822144},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12714287638664246},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.12072065472602844},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.09158498048782349},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.08896011114120483}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6599264740943909},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.547420859336853},{"id":"https://openalex.org/C200594392","wikidata":"https://www.wikidata.org/wiki/Q812529","display_name":"Bayesian game","level":4,"score":0.5238794684410095},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.4813033640384674},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4705812335014343},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.4680713415145874},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4605698883533478},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.44562941789627075},{"id":"https://openalex.org/C2779888511","wikidata":"https://www.wikidata.org/wiki/Q244156","display_name":"Traffic congestion","level":2,"score":0.42783018946647644},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3506593704223633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3232426047325134},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.19746020436286926},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1457347273826599},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.14546364545822144},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12714287638664246},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.12072065472602844},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.09158498048782349},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.08896011114120483},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2018.8618652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2018.8618652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1573960131","https://openalex.org/W1981248079","https://openalex.org/W2001268520","https://openalex.org/W2004789284","https://openalex.org/W2025745283","https://openalex.org/W2029456721","https://openalex.org/W2078424621","https://openalex.org/W2118480861","https://openalex.org/W2177295793","https://openalex.org/W2232678697","https://openalex.org/W2324723441","https://openalex.org/W2736051682","https://openalex.org/W2782616572","https://openalex.org/W2914851114","https://openalex.org/W2963336838","https://openalex.org/W4301479452","https://openalex.org/W6740911351"],"related_works":["https://openalex.org/W2892220642","https://openalex.org/W2024471263","https://openalex.org/W4360764540","https://openalex.org/W2034785493","https://openalex.org/W4231657010","https://openalex.org/W2182424533","https://openalex.org/W2754655211","https://openalex.org/W2975191991","https://openalex.org/W3092051745","https://openalex.org/W2167396098"],"abstract_inverted_index":{"We":[0,120],"study":[1],"the":[2,59,99,103,133,136,145,149,170,179,185,202],"problem":[3],"of":[4,17,51,90,98,138],"designing":[5],"an":[6,123],"efficient":[7],"signaling":[8,125,164],"policy":[9,126,165,182],"for":[10,127],"a":[11,18,43,79,88,130,159,198],"traffic":[12,195],"manager":[13],"(TM)":[14],"when":[15,184],"parts":[16],"network":[19,45,173],"experience":[20],"unpredictable":[21,56,153],"congestion":[22,57,140,147,186],"and":[23,77,85,106,142,196],"delays":[24,154],"due":[25],"to":[26,63,115,168,194],"external":[27],"factors,":[28],"such":[29],"as":[30],"accidents":[31],"or":[32,192],"construction":[33],"that":[34,87,122],"blocks":[35],"some":[36,156],"lanes.":[37],"To":[38],"this":[39,162],"end,":[40],"we":[41,67,176],"consider":[42,68],"simple":[44],"with":[46,151],"two":[47,69],"parallel":[48],"routes,":[49],"one":[50],"which":[52],"suffers":[53],"from":[54,75,82],"more":[55,152],"than":[58],"other.":[60],"In":[61],"order":[62,114],"understand":[64],"drivers'":[65],"behavior,":[66],"scenarios":[70],"-":[71,84],"(i)":[72],"no":[73],"information":[74,112],"TM":[76,83,100,128,134],"(ii)":[78],"binary":[80],"signal":[81,101],"assume":[86],"fraction":[89],"drivers,":[91,94],"called":[92],"informed":[93],"can":[95],"make":[96,107],"use":[97],"in":[102,113],"latter":[104],"case":[105],"decisions":[108],"based":[109],"on":[110,148,201],"updated":[111],"minimize":[116],"their":[117],"expected":[118,171],"delay.":[119,174],"show":[121],"optimal":[124,163,180,203],"is":[129,166,188],"threshold":[131,181],"policy:":[132],"warns":[135],"drivers":[137],"high":[139],"if":[141,144],"only":[143],"observed":[146],"route":[150],"exceeds":[155],"threshold.":[157,204],"Under":[158],"mild":[160],"condition,":[161],"guaranteed":[167],"reduce":[169],"overall":[172],"Moreover,":[175],"examine":[177],"how":[178],"behaves":[183],"delay":[187],"either":[189],"very":[190],"sensitive":[191],"insensitive":[193],"provide":[197],"lower":[199],"bound":[200]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}