{"id":"https://openalex.org/W1965829562","doi":"https://doi.org/10.1109/cdc.2013.6759943","title":"Decomposition techniques for Markov zero-sum games with nested information","display_name":"Decomposition techniques for Markov zero-sum games with nested information","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W1965829562","doi":"https://doi.org/10.1109/cdc.2013.6759943","mag":"1965829562"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2013.6759943","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6759943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","raw_type":"proceedings-article"},"type":"conference-paper","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/A5035901955","display_name":"Jiefu Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiefu Zheng","raw_affiliation_strings":["Boston University","Syst. Eng., Boston Univ., Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University","institution_ids":[]},{"raw_affiliation_string":"Syst. Eng., Boston Univ., Boston, MA, USA","institution_ids":["https://openalex.org/I111088046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103073490","display_name":"David A. Casta\u00f1\u00f3n","orcid":"https://orcid.org/0000-0002-9635-9776"},"institutions":[{"id":"https://openalex.org/I111088046","display_name":"Boston University","ror":"https://ror.org/05qwgg493","country_code":"US","type":"education","lineage":["https://openalex.org/I111088046"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David A. Castanon","raw_affiliation_strings":["Boston University","[Electr. & Comput. Eng., Boston Univ., Boston, MA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston University","institution_ids":[]},{"raw_affiliation_string":"[Electr. & Comput. Eng., Boston Univ., Boston, MA, USA]","institution_ids":["https://openalex.org/I111088046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111088046"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.07618834,"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":"574","last_page":"581"},"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.9998000264167786,"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.9998000264167786,"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/T10917","display_name":"Smart Grid Security and Resilience","score":0.9898999929428101,"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"}},{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9746999740600586,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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.6790344715118408},{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.6143031716346741},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.6133517026901245},{"id":"https://openalex.org/keywords/repeated-game","display_name":"Repeated game","score":0.5421687960624695},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.5308540463447571},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.5080864429473877},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4983794689178467},{"id":"https://openalex.org/keywords/zero-sum-game","display_name":"Zero-sum game","score":0.4975326359272003},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.49488896131515503},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.4661814868450165},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4536608159542084},{"id":"https://openalex.org/keywords/example-of-a-game-without-a-value","display_name":"Example of a game without a value","score":0.4471568465232849},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.44391822814941406},{"id":"https://openalex.org/keywords/bellman-equation","display_name":"Bellman equation","score":0.41331779956817627},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3324105143547058},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.26786428689956665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2541874051094055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2473207414150238},{"id":"https://openalex.org/keywords/normal-form-game","display_name":"Normal-form game","score":0.20837125182151794},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.15366730093955994},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09100618958473206}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6790344715118408},{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.6143031716346741},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.6133517026901245},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.5421687960624695},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.5308540463447571},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.5080864429473877},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4983794689178467},{"id":"https://openalex.org/C136356330","wikidata":"https://www.wikidata.org/wiki/Q156612","display_name":"Zero-sum game","level":3,"score":0.4975326359272003},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.49488896131515503},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.4661814868450165},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4536608159542084},{"id":"https://openalex.org/C138328387","wikidata":"https://www.wikidata.org/wiki/Q5419308","display_name":"Example of a game without a value","level":5,"score":0.4471568465232849},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.44391822814941406},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.41331779956817627},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3324105143547058},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.26786428689956665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2541874051094055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2473207414150238},{"id":"https://openalex.org/C155930848","wikidata":"https://www.wikidata.org/wiki/Q1069099","display_name":"Normal-form game","level":4,"score":0.20837125182151794},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.15366730093955994},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09100618958473206},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2013.6759943","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6759943","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1513526226","https://openalex.org/W1532688806","https://openalex.org/W1978425349","https://openalex.org/W2014731493","https://openalex.org/W2016305567","https://openalex.org/W2023373582","https://openalex.org/W2034725503","https://openalex.org/W2045640143","https://openalex.org/W2065087844","https://openalex.org/W2078540258","https://openalex.org/W2094463866","https://openalex.org/W2117972428","https://openalex.org/W2133494553","https://openalex.org/W2136427775","https://openalex.org/W2138336119","https://openalex.org/W2148534455","https://openalex.org/W2153561032","https://openalex.org/W2158907787","https://openalex.org/W2498386205","https://openalex.org/W3101822862","https://openalex.org/W6630693202","https://openalex.org/W6631864160"],"related_works":["https://openalex.org/W3028528379","https://openalex.org/W2395347989","https://openalex.org/W143065017","https://openalex.org/W1780386005","https://openalex.org/W2290305000","https://openalex.org/W2286377751","https://openalex.org/W2910530315","https://openalex.org/W1514842472","https://openalex.org/W2923980819","https://openalex.org/W2922568151"],"abstract_inverted_index":{"Markov":[0,59,127],"zero-sum":[1],"games":[2,45],"arise":[3],"in":[4,25,113,144],"applications":[5],"such":[6],"as":[7,57,112],"network":[8,16,36,52,181],"interdiction,":[9],"where":[10,46,183],"an":[11,83,152,177],"informed":[12],"defender":[13],"protects":[14],"a":[15,58,76,147],"against":[17],"attacks.":[18,195],"This":[19,100],"problem":[20],"has":[21],"received":[22],"significant":[23],"attention":[24],"recent":[26],"years":[27],"due":[28],"to":[29,32,190],"its":[30],"relevance":[31],"military":[33],"problems":[34,163],"and":[35,54,81,92],"security.":[37],"In":[38],"this":[39,56,123],"paper,":[40],"we":[41,70,132],"focus":[42],"on":[43],"finite":[44],"the":[47,51,66,72,87,90,93,98,104,107,126,130,135,138,168,184,194],"attacker":[48,185],"knows":[49],"imperfectly":[50],"state,":[53],"formulate":[55],"game":[60,74,91,108,139],"with":[61,176],"nested":[62,67],"information.":[63],"By":[64],"exploiting":[65],"information":[68,153],"structure,":[69],"decompose":[71],"multistage":[73,170,180],"into":[75],"sequence":[77],"of":[78,89,106,129,137,146,151,179,193],"one-stage":[79],"subgames":[80],"develop":[82],"algorithm":[84],"that":[85,121,134],"computes":[86,103],"value":[88,105,136,149],"saddle":[94],"point":[95],"strategies":[96,120],"for":[97],"game.":[99,171],"decomposition":[101],"method":[102],"using":[109],"backward":[110],"induction":[111],"stochastic":[114],"dynamic":[115],"programming,":[116],"then":[117],"identifies":[118],"saddle-point":[119],"achieve":[122],"value.":[124],"Using":[125],"structure":[128],"game,":[131],"show":[133],"can":[140],"be":[141,188],"computed":[142],"efficiently":[143],"terms":[145],"single":[148,160],"function":[150],"state":[154],"at":[155],"each":[156],"stage.":[157],"The":[158],"resulting":[159],"stage":[161],"optimization":[162],"are":[164],"much":[165],"smaller":[166],"than":[167],"original":[169],"We":[172],"illustrate":[173],"our":[174],"results":[175],"example":[178],"interdiction":[182],"may":[186],"not":[187],"able":[189],"observe":[191],"outcomes":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}