{"id":"https://openalex.org/W7140232617","doi":"https://doi.org/10.48550/arxiv.2603.21532","title":"Stationary Online Contention Resolution Schemes","display_name":"Stationary Online Contention Resolution Schemes","publication_year":2026,"publication_date":"2026-03-23","ids":{"openalex":"https://openalex.org/W7140232617","doi":"https://doi.org/10.48550/arxiv.2603.21532"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.21532","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21532","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.21532","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Aminian, Mohammad Reza","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aminian, Mohammad Reza","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Niazadeh, Rad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Niazadeh, Rad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Nuti, Pranav","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nuti, Pranav","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.8276000022888184,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.8276000022888184,"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/T13553","display_name":"Age of Information Optimization","score":0.03290000185370445,"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/T12288","display_name":"Optimization and Search Problems","score":0.025299999862909317,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.5169000029563904},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4968999922275543},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48069998621940613},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4284999966621399},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.421999990940094},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4133000075817108},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.3926999866962433},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.390500009059906},{"id":"https://openalex.org/keywords/resolution","display_name":"Resolution (logic)","score":0.3846000134944916}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6086999773979187},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.5169000029563904},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4968999922275543},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48069998621940613},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4269999861717224},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.421999990940094},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4133000075817108},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.3926999866962433},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.390500009059906},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3544999957084656},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3497999906539917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3467000126838684},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C79772020","wikidata":"https://www.wikidata.org/wiki/Q5159264","display_name":"Conditional independence","level":2,"score":0.33880001306533813},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26820001006126404},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.2542000114917755},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.21532","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21532","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":"doi:10.48550/arxiv.2603.21532","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.21532","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Online":[0],"contention":[1,77],"resolution":[2,78],"schemes":[3,79],"(OCRSs)":[4],"are":[5,64],"a":[6,32,81,111,118,142,197,206],"central":[7],"tool":[8],"in":[9,61,86,243],"Bayesian":[10],"online":[11,23,76,113,131],"selection":[12],"and":[13,46,57,124,149,184,205,222,237],"resource":[14],"allocation:":[15],"they":[16],"convert":[17],"fractional":[18],"ex-ante":[19],"relaxations":[20],"into":[21],"feasible":[22,93,138],"policies":[24,132],"while":[25],"preserving":[26],"each":[27],"marginal":[28],"probability":[29],"up":[30],"to":[31,54,66,122,133,181],"constant":[33],"factor.":[34],"Despite":[35],"their":[36],"importance,":[37],"designing":[38,147],"(near)":[39],"optimal":[40,183],"OCRSs":[41,85,247],"is":[42,95],"often":[43],"technically":[44,251],"challenging,":[45],"many":[47],"existing":[48],"constructions":[49],"rely":[50],"on":[51],"indirect":[52],"reductions":[53],"prophet":[55,189],"inequalities":[56],"LP":[58],"duality,":[59],"resulting":[60],"algorithms":[62,242],"that":[63,102],"difficult":[65],"interpret":[67],"or":[68,250],"implement.":[69],"In":[70,165],"this":[71,158,192],"paper,":[72],"we":[73,167],"introduce":[74],"\"stationary":[75],"(S-OCRSs),\"":[80],"permutation-invariant":[82],"class":[83],"of":[84,90,97,130,157],"which":[87],"the":[88,91,128,155,177,186,228],"distribution":[89],"selected":[92],"set":[94],"independent":[96],"arrival":[98],"order.":[99],"We":[100,115,153,194],"show":[101],"S-OCRSs":[103],"admit":[104],"an":[105,169],"exact":[106],"distributional":[107],"characterization":[108],"together":[109],"with":[110],"universal":[112],"implementation.":[114],"then":[116],"develop":[117],"general":[119],"`maximum-entropy'":[120],"approach":[121],"construct":[123],"analyze":[125],"S-OCRSs,":[126],"reducing":[127],"design":[129],"constructing":[134],"suitable":[135],"distributions":[136],"over":[137],"sets.":[139],"This":[140],"yields":[141,235],"new":[143],"technical":[144],"framework":[145,159,233],"for":[146,173,191,202,211],"simple":[148],"possibly":[150],"improved":[151,170],"OCRSs.":[152],"demonstrate":[154],"power":[156],"across":[160],"several":[161],"canonical":[162],"feasibility":[163],"environments.":[164],"particular,":[166],"obtain":[168,196],"$(3-\\sqrt{5})/2$-selectable":[171],"OCRS":[172,201,210],"bipartite":[174],"matchings,":[175],"attaining":[176],"independence":[178],"benchmark":[179],"conjectured":[180],"be":[182],"yielding":[185],"best":[187,229],"known":[188,230],"inequality":[190],"setting.":[193],"also":[195,234],"$1-\\sqrt{2/(\u03c0k)}":[198],"+":[199],"O(1/k)$-selectable":[200],"$k$-uniform":[203],"matroids":[204,214,218],"simple,":[207],"explicit":[208],"$1/2$-selectable":[209],"weakly":[212],"Rayleigh":[213],"(including":[215],"all":[216],"$\\mathbb{C}$-representable":[217],"such":[219],"as":[220],"graphic":[221],"laminar).":[223],"While":[224],"these":[225],"guarantees":[226],"match":[227],"bounds,":[231],"our":[232],"concrete":[236],"systematic":[238],"constructions,":[239],"providing":[240],"transparent":[241],"settings":[244],"where":[245],"previous":[246],"were":[248],"implicit":[249],"involved.":[252]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-25T00:00:00"}