{"id":"https://openalex.org/W2288333746","doi":"https://doi.org/10.1109/allerton.2015.7447026","title":"Network flow routing under strategic link disruptions","display_name":"Network flow routing under strategic link disruptions","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2288333746","doi":"https://doi.org/10.1109/allerton.2015.7447026","mag":"2288333746"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2015.7447026","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2015.7447026","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1512.09335","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067459518","display_name":"Mathieu Dahan","orcid":"https://orcid.org/0000-0003-0973-6973"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mathieu Dahan","raw_affiliation_strings":["Center for Computational Engineering (CCE) Massachusetts Institute of Technology Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"Center for Computational Engineering (CCE) Massachusetts Institute of Technology Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112133200","display_name":"Saurabh Amin","orcid":"https://orcid.org/0000-0003-1554-015X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saurabh Amin","raw_affiliation_strings":["Department of Civil & Environmental Engineering, Massachusetts Institute of Technology Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"Department of Civil & Environmental Engineering, Massachusetts Institute of Technology Cambridge, MA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067459518"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.5641,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84973186,"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":"353","last_page":"360"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9879000186920166,"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"}},{"id":"https://openalex.org/T10917","display_name":"Smart Grid Security and Resilience","score":0.9534000158309937,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6420336365699768},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6173468232154846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5943077802658081},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.5791710019111633},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5654189586639404},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5636882781982422},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5399923324584961},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5314969420433044},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.5299224257469177},{"id":"https://openalex.org/keywords/marginal-cost","display_name":"Marginal cost","score":0.5159850716590881},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.509558916091919},{"id":"https://openalex.org/keywords/strategy","display_name":"Strategy","score":0.4800094962120056},{"id":"https://openalex.org/keywords/marginal-value","display_name":"Marginal value","score":0.4650259017944336},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4621930718421936},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45177382230758667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26171404123306274},{"id":"https://openalex.org/keywords/microeconomics","display_name":"Microeconomics","score":0.2232988178730011},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.21678951382637024},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12427103519439697}],"concepts":[{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6420336365699768},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6173468232154846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5943077802658081},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.5791710019111633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5654189586639404},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5636882781982422},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5399923324584961},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5314969420433044},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5299224257469177},{"id":"https://openalex.org/C66887028","wikidata":"https://www.wikidata.org/wiki/Q382444","display_name":"Marginal cost","level":2,"score":0.5159850716590881},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.509558916091919},{"id":"https://openalex.org/C88959737","wikidata":"https://www.wikidata.org/wiki/Q1546627","display_name":"Strategy","level":3,"score":0.4800094962120056},{"id":"https://openalex.org/C117410459","wikidata":"https://www.wikidata.org/wiki/Q1895266","display_name":"Marginal value","level":2,"score":0.4650259017944336},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4621930718421936},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45177382230758667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26171404123306274},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.2232988178730011},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.21678951382637024},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12427103519439697},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/allerton.2015.7447026","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2015.7447026","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1512.09335","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1512.09335","pdf_url":"https://arxiv.org/pdf/1512.09335","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1512.09335","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1512.09335","pdf_url":"https://arxiv.org/pdf/1512.09335","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1738845896","https://openalex.org/W1857269571","https://openalex.org/W1886027077","https://openalex.org/W1966962864","https://openalex.org/W2000050888","https://openalex.org/W2002531683","https://openalex.org/W2026904841","https://openalex.org/W2044667552","https://openalex.org/W2097718363","https://openalex.org/W2117972428","https://openalex.org/W2125467036","https://openalex.org/W2133182510","https://openalex.org/W2133494553","https://openalex.org/W2149342630","https://openalex.org/W2270253310","https://openalex.org/W2951806815","https://openalex.org/W3124248355","https://openalex.org/W3124507064","https://openalex.org/W4205311788","https://openalex.org/W4213060883","https://openalex.org/W4230937734","https://openalex.org/W4301478651","https://openalex.org/W6637741074"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W2080904092","https://openalex.org/W3035974271","https://openalex.org/W3161514703","https://openalex.org/W3207627914","https://openalex.org/W2270959725","https://openalex.org/W2151525839","https://openalex.org/W2764325809","https://openalex.org/W648253840","https://openalex.org/W2051329268"],"abstract_inverted_index":{"This":[0,55],"paper":[1],"considers":[2],"a":[3,19,61,139],"2-player":[4],"strategic":[5],"game":[6,56],"for":[7],"network":[8,20],"routing":[9],"under":[10],"link":[11],"disruptions.":[12],"Player":[13,32],"1":[14],"(defender)":[15],"routes":[16],"flow":[17,27,47,127],"through":[18],"to":[21,41,60,74,150],"maximize":[22,42],"her":[23,43],"value":[24,44,103,117],"of":[25,45,52,104,111,118,125,141],"effective":[26,119,126],"while":[28],"facing":[29],"transportation":[30,97,147],"costs.":[31],"2":[33],"(attacker)":[34],"simultaneously":[35],"disrupts":[36],"one":[37],"or":[38],"more":[39],"links":[40],"lost":[46,105],"but":[48],"also":[49],"faces":[50],"cost":[51,98,110,148],"disrupting":[53],"links.":[54],"is":[57],"strategically":[58],"equivalent":[59],"zero-sum":[62],"game.":[63],"Linear":[64],"programming":[65],"duality":[66],"and":[67],"the":[68,94,107,122,142],"max-flow":[69,144],"min-cut":[70],"theorem":[71],"are":[72,78],"applied":[73],"obtain":[75],"properties":[76],"that":[77],"satisfied":[79],"in":[80,100,114,129],"any":[81,86],"mixed":[82],"Nash":[83],"equilibrium.":[84],"In":[85],"equilibrium,":[87],"both":[88,130],"players":[89],"achieve":[90],"identical":[91],"payoffs.":[92],"While":[93],"defender's":[95,115],"expected":[96,109,123],"decreases":[99,128],"attacker's":[101,108],"marginal":[102,116],"flow,":[106],"attack":[112],"increases":[113],"flow.":[120],"Interestingly,":[121],"amount":[124],"these":[131],"parameters.":[132],"These":[133],"results":[134],"can":[135],"be":[136],"viewed":[137],"as":[138],"generalization":[140],"classical":[143],"with":[145],"minimum":[146],"problem":[149],"adversarial":[151],"environments.":[152]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}