{"id":"https://openalex.org/W6884882126","doi":"https://doi.org/10.13016/lydy-6g2x","title":"An Approximation Framework for Large-Scale Spatial Games","display_name":"An Approximation Framework for Large-Scale Spatial Games","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W6884882126","doi":"https://doi.org/10.13016/lydy-6g2x"},"language":"en","primary_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/32713","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/32713","pdf_url":"https://drum.lib.umd.edu/bitstreams/215f2ebf-3eff-47ea-9e57-8e927b18197f/download","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Dissertation"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drum.lib.umd.edu/bitstreams/215f2ebf-3eff-47ea-9e57-8e927b18197f/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hsiao, Vincent","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hsiao, Vincent","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4984999895095825},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.49410000443458557},{"id":"https://openalex.org/keywords/evolutionary-game-theory","display_name":"Evolutionary game theory","score":0.48489999771118164},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.48339998722076416},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4781999886035919},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.4657999873161316},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.4296000003814697},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.4075999855995178}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6736000180244446},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4984999895095825},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.49410000443458557},{"id":"https://openalex.org/C20249471","wikidata":"https://www.wikidata.org/wiki/Q2298789","display_name":"Evolutionary game theory","level":3,"score":0.48489999771118164},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.48339998722076416},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4781999886035919},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4657999873161316},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.4296000003814697},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41620001196861267},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.4075999855995178},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.3953999876976013},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.39489999413490295},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35690000653266907},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.352400004863739},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3522999882698059},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3280999958515167},{"id":"https://openalex.org/C200594392","wikidata":"https://www.wikidata.org/wiki/Q812529","display_name":"Bayesian game","level":4,"score":0.3102000057697296},{"id":"https://openalex.org/C171578705","wikidata":"https://www.wikidata.org/wiki/Q5418700","display_name":"Evolutionary dynamics","level":3,"score":0.3093000054359436},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.30410000681877136},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C82142266","wikidata":"https://www.wikidata.org/wiki/Q3456604","display_name":"Dynamic Bayesian network","level":3,"score":0.2874999940395355},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C77405623","wikidata":"https://www.wikidata.org/wiki/Q598451","display_name":"System dynamics","level":2,"score":0.25209999084472656},{"id":"https://openalex.org/C47822265","wikidata":"https://www.wikidata.org/wiki/Q854457","display_name":"Complex system","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drum.lib.umd.edu:1903/32713","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/32713","pdf_url":"https://drum.lib.umd.edu/bitstreams/215f2ebf-3eff-47ea-9e57-8e927b18197f/download","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Dissertation"},{"id":"doi:10.13016/lydy-6g2x","is_oa":true,"landing_page_url":"https://doi.org/10.13016/lydy-6g2x","pdf_url":null,"source":{"id":"https://openalex.org/S4306402644","display_name":"Digital Repository at the University of Maryland (University of Maryland College Park)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"}],"best_oa_location":{"id":"pmh:oai:drum.lib.umd.edu:1903/32713","is_oa":true,"landing_page_url":"http://hdl.handle.net/1903/32713","pdf_url":"https://drum.lib.umd.edu/bitstreams/215f2ebf-3eff-47ea-9e57-8e927b18197f/download","source":{"id":"https://openalex.org/S4306401518","display_name":"University Libraries (University of Maryland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66946132","host_organization_name":"University of Maryland, College Park","host_organization_lineage":["https://openalex.org/I66946132"],"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":"Dissertation"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6884882126.pdf","grobid_xml":"https://content.openalex.org/works/W6884882126.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Game":[0],"theoretic":[1,30],"modeling":[2,55,156],"paradigms":[3,56],"such":[4,311],"as":[5,144,312],"Evolutionary":[6],"Games":[7,11],"and":[8,48,86,89,94,114,134,158,187,247,255,318],"Mean":[9],"Field":[10],"(MFG)":[12],"are":[13,81,103],"used":[14,217],"to":[15,35,40,50,65,72,83,107,202,218,292,306],"model":[16,254],"a":[17,28,46,154,234,260,269,277,307],"variety":[18,308],"of":[19,45,140,177,223,285,300,309],"multi-agent":[20,165],"systems":[21],"in":[22,27,67,137],"which":[23],"the":[24,42,98,131,138,204,220,252,283,298],"agents":[25,111],"interact":[26],"game":[29,149,314],"fashion.":[31],"These":[32],"models":[33,80,102],"seek":[34],"answer":[36],"two":[37],"questions:":[38],"how":[39,49],"predict":[41],"forward":[43,142],"dynamics":[44,143],"population":[47],"control":[51,278,288],"them.":[52],"However,":[53],"both":[54,87],"have":[57,112],"unique":[58],"issues":[59,206],"that":[60],"can":[61],"make":[62],"them":[63],"difficult":[64,82],"analyze":[66],"closed":[68],"form":[69],"when":[70,290],"applied":[71],"spatial":[73,78,126,168,181,199,248],"domains.":[74,169],"On":[75,97],"one":[76],"hand,":[77,100],"EGT":[79],"evaluate":[84],"mathematically":[85],"simulations":[88],"approximations":[90,258,275],"run":[91],"into":[92,259,276],"accuracy":[93,133,205],"tractability":[95],"issues.":[96],"other":[99],"MFG":[101,119,241,294],"not":[104],"typically":[105],"formulated":[106],"handle":[108],"domains":[109,127,310],"where":[110],"strategies":[113],"physical":[115],"locations.":[116],"Furthermore,":[117],"any":[118],"approach":[120],"for":[121,163,198,236,242,271,282],"controlling":[122],"strategy":[123,246],"evolution":[124],"on":[125,167],"need":[128],"also":[129],"address":[130,203],"same":[132],"efficiency":[135,222],"challenges":[136],"evaluation":[139],"its":[141,304],"those":[145],"faced":[146,207],"by":[147,208],"evolutionary":[148,182,200,313],"approaches.":[150,295],"This":[151],"dissertation":[152],"presents":[153],"new":[155,171],"paradigm":[157],"approximation":[159,196,211],"technique":[160,197],"termed":[161],"Bayesian-MFG":[162,262],"large-scale":[164],"games":[166,201],"The":[170],"framework":[172,280,302],"lies":[173],"at":[174],"an":[175],"intersection":[176],"techniques":[178],"drawn":[179],"from":[180],"games,":[183,186],"mean":[184],"field":[185],"probabilistic":[188],"reasoning.":[189],"First,":[190],"we":[191,229,267],"describe":[192,230],"our":[193,231,301],"Bayesian":[194,224,256,273],"network":[195,225,257,274,319],"lower":[209],"order":[210],"methods.":[212],"We":[213,250,296],"introduce":[214],"additional":[215],"algorithms":[216],"improve":[219],"computational":[221],"approximations.":[226],"Alongside":[227],"this,":[228],"Pair-MFG":[232],"model,":[233],"method":[235,270],"defining":[237],"pair":[238],"level":[239],"approximate":[240],"problems":[243],"with":[244],"distinct":[245],"components.":[249],"combine":[251],"pair-MFG":[253],"unified":[261],"framework.":[263],"Using":[264],"this":[265],"framework,":[266],"present":[268],"incorporating":[272],"problem":[279],"allowing":[281],"derivation":[284],"more":[286],"accurate":[287],"policies":[289],"compared":[291],"existing":[293],"demonstrate":[297],"effectiveness":[299],"through":[303],"application":[305],"theory,":[315],"reaction-diffusion":[316],"equations,":[317],"security.":[320]},"counts_by_year":[],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}