{"id":"https://openalex.org/W2566332244","doi":"https://doi.org/10.1109/itsc.2016.7795856","title":"A multiagent solution to overcome selfish routing in transportation networks","display_name":"A multiagent solution to overcome selfish routing in transportation networks","publication_year":2016,"publication_date":"2016-11-01","ids":{"openalex":"https://openalex.org/W2566332244","doi":"https://doi.org/10.1109/itsc.2016.7795856","mag":"2566332244"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2016.7795856","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2016.7795856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC)","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/A5101971620","display_name":"Mohammad Rashedul Hasan","orcid":"https://orcid.org/0000-0002-9818-9600"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammad Rashedul Hasan","raw_affiliation_strings":["University of Nebraska-Lincoln, 68588, USA","University of Nebraska-Lincoln, Lincoln, NE, US"],"affiliations":[{"raw_affiliation_string":"University of Nebraska-Lincoln, 68588, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"University of Nebraska-Lincoln, Lincoln, NE, US","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028225369","display_name":"Ana L. C. Bazzan","orcid":"https://orcid.org/0000-0002-2803-9607"},"institutions":[{"id":"https://openalex.org/I130442723","display_name":"Universidade Federal do Rio Grande do Sul","ror":"https://ror.org/041yk2d64","country_code":"BR","type":"education","lineage":["https://openalex.org/I130442723"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Ana L. C. Bazzan","raw_affiliation_strings":["PPGC / UFRGS, CP 15064, 91501-970, Brazil","Universidade Federal do Rio Grande do Sul, Porto Alegre, RS, BR"],"affiliations":[{"raw_affiliation_string":"PPGC / UFRGS, CP 15064, 91501-970, Brazil","institution_ids":["https://openalex.org/I130442723"]},{"raw_affiliation_string":"Universidade Federal do Rio Grande do Sul, Porto Alegre, RS, BR","institution_ids":["https://openalex.org/I130442723"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034774269","display_name":"Eliyahu Friedman","orcid":null},"institutions":[{"id":"https://openalex.org/I8031829","display_name":"Cooper Union","ror":"https://ror.org/05pbkcd34","country_code":"US","type":"education","lineage":["https://openalex.org/I8031829"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eliyahu Friedman","raw_affiliation_strings":["The Cooper Union, NY 10003, USA","Cooper Union for the Advancement of Science and Art, New York, NY, US"],"affiliations":[{"raw_affiliation_string":"The Cooper Union, NY 10003, USA","institution_ids":["https://openalex.org/I8031829"]},{"raw_affiliation_string":"Cooper Union for the Advancement of Science and Art, New York, NY, US","institution_ids":["https://openalex.org/I8031829"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055430969","display_name":"Anita Raja","orcid":"https://orcid.org/0000-0002-0735-7358"},"institutions":[{"id":"https://openalex.org/I8031829","display_name":"Cooper Union","ror":"https://ror.org/05pbkcd34","country_code":"US","type":"education","lineage":["https://openalex.org/I8031829"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anita Raja","raw_affiliation_strings":["The Cooper Union, NY 10003, USA","Cooper Union for the Advancement of Science and Art, New York, NY, US"],"affiliations":[{"raw_affiliation_string":"The Cooper Union, NY 10003, USA","institution_ids":["https://openalex.org/I8031829"]},{"raw_affiliation_string":"Cooper Union for the Advancement of Science and Art, New York, NY, US","institution_ids":["https://openalex.org/I8031829"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101971620"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":0.8839,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76727419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1850","last_page":"1855"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9980000257492065,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.72327721118927},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5823796987533569},{"id":"https://openalex.org/keywords/traffic-congestion","display_name":"Traffic congestion","score":0.536588728427887},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.519559383392334},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4641144871711731},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.4453832507133484},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43511515855789185},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1390857696533203},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11798951029777527},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.10549721121788025}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.72327721118927},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5823796987533569},{"id":"https://openalex.org/C2779888511","wikidata":"https://www.wikidata.org/wiki/Q244156","display_name":"Traffic congestion","level":2,"score":0.536588728427887},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.519559383392334},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4641144871711731},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.4453832507133484},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43511515855789185},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1390857696533203},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11798951029777527},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.10549721121788025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2016.7795856","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2016.7795856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1526250527","https://openalex.org/W1579344322","https://openalex.org/W1988651441","https://openalex.org/W1993286459","https://openalex.org/W2074699430","https://openalex.org/W2097568888","https://openalex.org/W2106804832","https://openalex.org/W2112269231","https://openalex.org/W2118480861","https://openalex.org/W2118899043","https://openalex.org/W2202689739","https://openalex.org/W2215496495","https://openalex.org/W2235269566","https://openalex.org/W2270934433","https://openalex.org/W2764937720","https://openalex.org/W4297563113","https://openalex.org/W6677741219","https://openalex.org/W6688133116","https://openalex.org/W6688426197","https://openalex.org/W6693955913"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2541760731"],"abstract_inverted_index":{"It":[0],"is":[1],"well-known":[2],"that":[3,40,81,92,112,137,146],"selfish":[4,62],"routing,":[5],"where":[6,70],"individual":[7],"agents":[8],"make":[9],"uncoordinated":[10,44],"greedy":[11],"routing":[12,63],"decisions,":[13],"does":[14],"not":[15],"produce":[16],"a":[17,52,71,78,106,130],"socially":[18],"desirable":[19],"outcome":[20],"in":[21,46,64,95],"transport":[22],"and":[23,48,162],"communication":[24],"networks.":[25],"In":[26],"this":[27,31],"paper,":[28],"we":[29,57],"address":[30],"general":[32],"problem":[33],"of":[34,37,73,77,98,159],"the":[35,117,122,157],"loss":[36],"social":[38,79,125,147],"welfare":[39],"occurs":[41],"due":[42],"to":[43,60,101,155],"behavior":[45],"networks":[47,66,99],"model":[49],"it":[50],"as":[51],"multiagent":[53,150],"coordination":[54,110,153],"problem.":[55],"Specifically":[56],"study":[58],"strategies":[59],"overcome":[61],"traffic":[65,83,89,109,151],"with":[67],"multiple":[68],"routes":[69],"subset":[72],"vehicles":[74],"are":[75,93],"part":[76],"network":[80,148],"exchanges":[82],"related":[84],"data.":[85],"We":[86,104,127],"investigate":[87],"classic":[88],"flow":[90],"paradoxes":[91,161],"ubiquitous":[94],"various":[96],"types":[97],"leading":[100],"severe":[102],"congestion.":[103,165],"present":[105],"novel":[107],"distributed":[108],"algorithm":[111],"alleviates":[113],"congestion":[114],"by":[115],"harnessing":[116],"real-time":[118],"information":[119],"available":[120],"through":[121],"driver's":[123],"online":[124],"network.":[126],"also":[128],"propose":[129],"utility":[131],"computation":[132],"mechanism":[133],"for":[134],"route":[135,152],"choice":[136],"generates":[138],"near-optimal":[139],"flows.":[140],"Our":[141],"extensive":[142],"simulation":[143],"results":[144],"show":[145],"based":[149],"contributes":[154],"mitigate":[156],"effects":[158],"these":[160],"significantly":[163],"reduces":[164]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-25T21:42:39.735039","created_date":"2025-10-10T00:00:00"}