{"id":"https://openalex.org/W4416026382","doi":"https://doi.org/10.48550/arxiv.2511.04484","title":"Online Algorithms for Repeated Optimal Stopping: Achieving Both Competitive Ratio and Regret Bounds","display_name":"Online Algorithms for Repeated Optimal Stopping: Achieving Both Competitive Ratio and Regret Bounds","publication_year":2025,"publication_date":"2025-11-06","ids":{"openalex":"https://openalex.org/W4416026382","doi":"https://doi.org/10.48550/arxiv.2511.04484"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2511.04484","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.04484","pdf_url":"https://arxiv.org/pdf/2511.04484","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.04484","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038928762","display_name":"Tsubasa Harada","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harada, Tsubasa","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025634820","display_name":"Yasushi Kawase","orcid":"https://orcid.org/0000-0001-5626-779X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kawase, Yasushi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5040863107","display_name":"Hanna Sumita","orcid":"https://orcid.org/0000-0003-4005-3206"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sumita, Hanna","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038928762"],"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":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9757000207901001,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9757000207901001,"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"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.018300000578165054,"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/T11182","display_name":"Auction Theory and Applications","score":0.0012000000569969416,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8824999928474426},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.8201000094413757},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6359999775886536},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.572700023651123},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5723999738693237},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5695000290870667},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.5393999814987183},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.40790000557899475}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8824999928474426},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8201000094413757},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6359999775886536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.580299973487854},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.572700023651123},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5723999738693237},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5695000290870667},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.5393999814987183},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5203999876976013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5048999786376953},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.40790000557899475},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.40389999747276306},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.37599998712539673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3637999892234802},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.32280001044273376},{"id":"https://openalex.org/C2983961125","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping rule","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C186394612","wikidata":"https://www.wikidata.org/wiki/Q7098942","display_name":"Optimal design","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.25920000672340393}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2511.04484","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.04484","pdf_url":"https://arxiv.org/pdf/2511.04484","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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.2511.04484","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.04484","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2511.04484","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.04484","pdf_url":"https://arxiv.org/pdf/2511.04484","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":[{"id":"https://openalex.org/G1069223013","display_name":null,"funder_award_id":"JSPS KAKENHI","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G2029697034","display_name":null,"funder_award_id":"JP21K17708","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3459562248","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4636223006","display_name":null,"funder_award_id":"JSPS KAK","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5393979288","display_name":null,"funder_award_id":"JP21H03397","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7718859585","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320322622","funder_display_name":"Toyota Motor Corporation"},{"id":"https://openalex.org/G7924322763","display_name":"\u7af6\u5408\u6bd4\u89e3\u6790\u3068\u30ea\u30b0\u30ec\u30c3\u30c8\u89e3\u6790\u306e\u878d\u5408\u306b\u3088\u308b\u30aa\u30f3\u30e9\u30a4\u30f3\u6700\u9069\u5316\u306e\u767a\u5c55","funder_award_id":"25K00137","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8050369292","display_name":null,"funder_award_id":"21H03397","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8058665615","display_name":null,"funder_award_id":"JPMJER2301","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8430481527","display_name":null,"funder_award_id":"Number","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G925228835","display_name":null,"funder_award_id":"JPMJER2301","funder_id":"https://openalex.org/F4320338112","funder_display_name":"Exploratory Research for Advanced Technology"},{"id":"https://openalex.org/G94861357","display_name":"\u60c5\u5831\u306e\u6b20\u5982\u3057\u305f\u516c\u5e73\u5206\u5272\u554f\u984c\u306b\u5bfe\u3059\u308b\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0","funder_award_id":"21K17708","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320322622","display_name":"Toyota Motor Corporation","ror":"https://ror.org/02zqm6r10"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320338112","display_name":"Exploratory Research for Advanced Technology","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416026382.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,145],"study":[1],"the":[2,9,22,100,128,138,147,157,160,176,188,207,221],"repeated":[3,73,177],"optimal":[4,11,74,96,217],"stopping":[5,12,75],"problem,":[6,162,180],"which":[7],"generalizes":[8],"classical":[10],"problem":[13,24],"with":[14,109,218],"an":[15,84,94,121,193],"unknown":[16],"distribution":[17],"to":[18,36,81,153,220],"a":[19,41,59,69,106,110,184,199],"setting":[20],"where":[21],"same":[23],"is":[25,58,80,141,215],"solved":[26],"repeatedly":[27],"over":[28],"$T$":[29],"rounds.":[30,54,224],"In":[31],"this":[32,117],"framework,":[33],"we":[34,119,197],"aim":[35],"design":[37,120],"algorithms":[38],"that":[39,63,123,137,211],"guarantee":[40],"competitive":[42,112],"ratio":[43,113,186],"in":[44,132,206],"each":[45,87],"round":[46,190],"while":[47,135],"also":[48],"achieving":[49],"sublinear":[50],"regret":[51,140,200],"across":[52],"all":[53],"Our":[55],"primary":[56],"contribution":[57],"general":[60],"algorithmic":[61],"framework":[62,152],"achieves":[64,183],"these":[65],"objectives":[66],"simultaneously":[67],"for":[68,86,175],"wide":[70],"array":[71],"of":[72,102,150,203,223],"problems.":[76],"The":[77],"core":[78],"idea":[79],"dynamically":[82],"select":[83],"algorithm":[85,97,108,122,131],"round,":[88,134],"choosing":[89],"between":[90],"two":[91],"candidates:":[92],"(1)":[93],"empirically":[95],"derived":[98],"from":[99,187],"history":[101],"observations,":[103],"and":[104,163,169,192],"(2)":[105],"sample-based":[107,130],"proven":[111],"guarantee.":[114],"Based":[115],"on":[116,191],"approach,":[118],"performs":[124],"no":[125],"worse":[126],"than":[127],"baseline":[129],"every":[133],"ensuring":[136],"total":[139],"bounded":[142],"by":[143],"$\\tilde{O}(\\sqrt{T})$.":[144],"demonstrate":[146],"broad":[148],"applicability":[149],"our":[151,181,212],"canonical":[154],"problems,":[155],"including":[156],"prophet":[158,178],"inequality,":[159],"secretary":[161],"their":[164],"variants":[165],"under":[166],"adversarial,":[167],"random,":[168],"i.i.d.":[170,208],"input":[171],"models.":[172],"For":[173],"example,":[174],"inequality":[179],"method":[182],"$1/2$-competitive":[185],"second":[189],"$\\tilde{O}(\\sqrt{T})$":[194],"regret.":[195],"Furthermore,":[196],"establish":[198],"lower":[201],"bound":[202],"$\u03a9(\\sqrt{T})$":[204],"even":[205],"model,":[209],"confirming":[210],"algorithm's":[213],"performance":[214],"almost":[216],"respect":[219],"number":[222]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-11-08T00:00:00"}