{"id":"https://openalex.org/W7213530442","doi":"https://doi.org/10.48550/arxiv.2609.17966","title":"The BAR-SOT Method: Long-term Average Cost Control as Stochastic Optimal Self-Transport","display_name":"The BAR-SOT Method: Long-term Average Cost Control as Stochastic Optimal Self-Transport","publication_year":2026,"publication_date":"2026-09-16","ids":{"openalex":"https://openalex.org/W7213530442","doi":"https://doi.org/10.48550/arxiv.2609.17966"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.17966","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17966","pdf_url":"https://arxiv.org/pdf/2609.17966","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.17966","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126222648","display_name":"Sharan Srinivasan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Srinivasan, Sharan","raw_affiliation_strings":["Elmore School of Electrical and Computer Engineering , Purdue University , West Lafayette , Indiana 47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Elmore School of Electrical and Computer Engineering , Purdue University , West Lafayette , Indiana 47907","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128916618","display_name":"Berke M. Turkay","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Turkay, Berke M.","raw_affiliation_strings":["Daniels School of Business , Purdue University , West Lafayette , Indiana 47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Daniels School of Business , Purdue University , West Lafayette , Indiana 47907","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070127492","display_name":"Harsha Honnappa","orcid":"https://orcid.org/0000-0002-0834-054X","observed_orcids":["https://orcid.org/0000-0002-0834-054X"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Honnappa, Harsha","raw_affiliation_strings":["Edwardson School of Industrial Engineering , Purdue University , West Lafayette , Indiana 47907"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Edwardson School of Industrial Engineering , Purdue University , West Lafayette , Indiana 47907","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219193219"],"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":false,"primary_topic":{"id":"https://openalex.org/T10229","display_name":"Geometric Analysis and Curvature Flows","score":0.5435000061988831,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10229","display_name":"Geometric Analysis and Curvature Flows","score":0.5435000061988831,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12794","display_name":"Adaptive Dynamic Programming Control","score":0.20430000126361847,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10067","display_name":"Stochastic processes and financial applications","score":0.05469999834895134,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/continuous-time-markov-chains","display_name":"continuous-time Markov chains","score":0.8330000042915344},{"id":"https://openalex.org/keywords/self-transport","display_name":"self-transport","score":0.8809999823570251},{"id":"https://openalex.org/keywords/ergodic-control","display_name":"ergodic control","score":0.7099999785423279},{"id":"https://openalex.org/keywords/schrodinger-bridge","display_name":"Schr\u00f6dinger bridge","score":0.7200000286102295},{"id":"https://openalex.org/keywords/finite-horizon-optimization","display_name":"finite-horizon optimization","score":0.6589999794960022},{"id":"https://openalex.org/keywords/stationary-potential","display_name":"stationary potential","score":0.5849999785423279},{"id":"https://openalex.org/keywords/physics-informed-neural-networks","display_name":"physics-informed neural networks","score":0.8360000252723694},{"id":"https://openalex.org/keywords/input-queued-switches","display_name":"input-queued switches","score":0.8939999938011169},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.6710000038146973},{"id":"https://openalex.org/keywords/long-run-average-cost","display_name":"long-run average cost","score":0.6909999847412109}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.707099974155426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5738999843597412},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.5440999865531921},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5303999781608582},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4855000078678131},{"id":"https://openalex.org/C202887219","wikidata":"https://www.wikidata.org/wiki/Q3895221","display_name":"Parametrization (atmospheric modeling)","level":3,"score":0.4812000095844269},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4666999876499176},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45899999141693115},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C170131372","wikidata":"https://www.wikidata.org/wiki/Q7617811","display_name":"Stochastic control","level":3,"score":0.3749000132083893},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.3578999936580658},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3578999936580658},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.3506999909877777},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.3490999937057495},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.34700000286102295},{"id":"https://openalex.org/C2776825372","wikidata":"https://www.wikidata.org/wiki/Q3922411","display_name":"Jump process","level":3,"score":0.33809998631477356},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C203479927","wikidata":"https://www.wikidata.org/wiki/Q5165939","display_name":"Controller (irrigation)","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C2780958618","wikidata":"https://www.wikidata.org/wiki/Q945621","display_name":"Average cost","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.3125},{"id":"https://openalex.org/C2778153524","wikidata":"https://www.wikidata.org/wiki/Q4241335","display_name":"Optimality criterion","level":2,"score":0.3125},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2937999963760376},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C107464732","wikidata":"https://www.wikidata.org/wiki/Q235781","display_name":"Adaptive control","level":3,"score":0.2768000066280365},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C66887028","wikidata":"https://www.wikidata.org/wiki/Q382444","display_name":"Marginal cost","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.2635999917984009},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.2623000144958496}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.17966","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17966","pdf_url":"https://arxiv.org/pdf/2609.17966","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},{"id":"doi:10.48550/arxiv.2609.17966","doi":"https://doi.org/10.48550/arxiv.2609.17966","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.17966","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.17966","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.17966","pdf_url":"https://arxiv.org/pdf/2609.17966","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G4478357159","display_name":"CAREER: Methods for Data-Driven Service Engineering","funder_award_id":"2143752","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6098521345","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213530442.pdf","grobid_xml":"https://content.openalex.org/works/W7213530442.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2063787625","https://openalex.org/W4388717888","https://openalex.org/W2951559786","https://openalex.org/W1970990249","https://openalex.org/W3140605133","https://openalex.org/W7161781977","https://openalex.org/W1976732220","https://openalex.org/W2612489420","https://openalex.org/W1449931206","https://openalex.org/W1577923533"],"abstract_inverted_index":{"We":[0,79,150],"reformulate":[1],"average-cost":[2,77],"(ergodic)":[3],"control":[4,121],"of":[5,74,170,193,202,225],"a":[6,11,37,71,87,101,105,123,130,175,203,222,239],"Markov":[7,156,164],"jump":[8,165],"process":[9],"as":[10,146,174],"finite-horizon":[12],"stochastic":[13],"optimal":[14,68,98],"transport":[15],"(SOT)":[16],"problem":[17,60],"that":[18,96,180,211,242],"jointly":[19],"optimizes":[20],"over":[21],"the":[22,26,42,46,50,58,75,97,114,120,143,147,152,171,189,200,214,219,226,230,247],"controlled":[23,47,85,163],"evolution":[24],"and":[25,33,90,94,159,195,213],"marginal":[27,43,92],"law":[28],"from":[29],"which":[30],"it":[31],"starts":[32],"returns":[34],"to":[35,45,113,142],"(i.e.,":[36],"self-transport).":[38],"The":[39],"constraint":[40],"relating":[41],"flow":[44],"generator":[48],"is":[49,70,100,137],"basic":[51],"adjoint":[52],"relationship":[53],"(BAR),":[54],"so":[55],"we":[56,234],"call":[57],"resulting":[59],"BAR-SOT.":[61],"For":[62],"any":[63],"time":[64],"horizon":[65],"T>0,":[66],"its":[67],"value":[69,140],"constant":[72],"scaling":[73],"long-run":[76],"rate.":[78,115],"give":[80],"three":[81],"equivalent":[82],"formulations":[83],"(through":[84],"processes,":[86],"Fokker--Planck":[88],"constraint,":[89],"relaxed":[91],"measures)":[93],"show":[95],"dual":[99,227],"stationary":[102],"potential":[103],"plus":[104],"term":[106],"linear":[107],"in":[108],"time,":[109],"with":[110,238,246],"slope":[111],"equal":[112],"A":[116,167],"relative-entropy":[117],"penalty":[118,148],"on":[119,209,229],"yields":[122],"cost-tilted":[124],"Schrodinger":[125],"bridge":[126],"problem,":[127],"computable":[128],"by":[129],"Sinkhorn-type":[131],"iteration":[132],"when":[133],"every":[134],"transition":[135],"rate":[136],"controlled,":[138],"whose":[139],"converges":[141],"unregularized":[144],"optimum":[145],"vanishes.":[149],"develop":[151],"theory":[153],"for":[154,161],"finite":[155],"decision":[157],"processes":[158],"then":[160,207],"general":[162],"processes.":[166],"neural":[168,177],"parametrization":[169,224],"dual,":[172],"trained":[173],"physics-informed":[176],"network":[178],"(PINN),":[179],"encodes":[181],"Harrison's":[182],"equivalent-workload":[183],"formulation":[184],"(see":[185],"Harrison":[186],"2000)":[187],"matches":[188],"strong":[190],"reinforcement-learning":[191],"baseline":[192,212],"Dai":[194],"Gluzman":[196],"(2022);":[197],"numerically":[198],"conditioning":[199],"fit":[201],"sub-dominant":[204],"transverse":[205],"correction":[206],"improves":[208,228],"both":[210],"best":[215],"priority":[216],"heuristic.":[217],"On":[218],"input-queued":[220],"switch,":[221],"graph-attention":[223],"strongest":[231],"matching":[232],"heuristic":[233],"are":[235],"aware":[236],"of,":[237],"parameter":[240],"count":[241],"does":[243],"not":[244],"grow":[245],"switch":[248],"size.":[249]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-09-18T00:00:00"}