{"id":"https://openalex.org/W7171572019","doi":"https://doi.org/10.48550/arxiv.2607.24115","title":"On Non-Stationary Dynamic Pricing: Adaptivity and Optimality","display_name":"On Non-Stationary Dynamic Pricing: Adaptivity and Optimality","publication_year":2026,"publication_date":"2026-07-27","ids":{"openalex":"https://openalex.org/W7171572019","doi":"https://doi.org/10.48550/arxiv.2607.24115"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.24115","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.24115","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,"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"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.24115","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011157122","display_name":"Feiyu Jiang","orcid":"https://orcid.org/0000-0002-6243-6200"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Feiyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5143815825","display_name":"Zifeng Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Zifeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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.9585000276565552,"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.9585000276565552,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.00419999985024333,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.004100000020116568,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/regret","display_name":"Regret","score":0.7454000115394592},{"id":"https://openalex.org/keywords/dynamic-pricing","display_name":"Dynamic pricing","score":0.6575000286102295},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.6306999921798706},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5224999785423279},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5199000239372253},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.41920000314712524},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.3926999866962433},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.38679999113082886},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.3508000075817108}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7454000115394592},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6980999708175659},{"id":"https://openalex.org/C2779391423","wikidata":"https://www.wikidata.org/wiki/Q17009728","display_name":"Dynamic pricing","level":2,"score":0.6575000286102295},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.6306999921798706},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5224999785423279},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5199000239372253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5020999908447266},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.41920000314712524},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.3926999866962433},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.38679999113082886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3718999922275543},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.3508000075817108},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C2781386248","wikidata":"https://www.wikidata.org/wiki/Q11898700","display_name":"Revenue management","level":3,"score":0.2921999990940094},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C167393769","wikidata":"https://www.wikidata.org/wiki/Q4680768","display_name":"Adaptive strategies","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.272599995136261},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.2685999870300293},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.24115","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.24115","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,"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":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.24115","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.24115","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,"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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,79,161],"study":[1],"the":[2,64,71,97,135,144,150,159,166,172,200,216,221],"contextual":[3,184],"dynamic":[4,137,185,226],"pricing":[5,138],"problem":[6],"under":[7],"non-stationarity,":[8],"where":[9,94],"a":[10,39,46,81,89,106,155,193],"firm":[11,65],"sells":[12],"products":[13,53],"to":[14,22,37,67,130,143,165,180,206,214],"$T$":[15],"sequentially":[16],"arriving":[17],"consumers":[18],"that":[19,27,51,87,140],"behave":[20],"according":[21],"an":[23],"unknown":[24,72],"demand":[25,33],"model":[26,34,42,115],"can":[28],"change":[29],"over":[30],"time.":[31],"The":[32,187],"is":[35,96,105,119,134,141,189],"assumed":[36],"be":[38,178],"generalized":[40],"linear":[41],"(GLM),":[43],"allowing":[44],"for":[45,76,183],"feature":[47],"vector":[48],"in":[49,158,171,224],"$\\mathbb{R}^d$":[50],"encodes":[52],"and":[54,69,103,121,148,218],"consumer":[55],"information.":[56],"To":[57],"achieve":[58,181],"optimal":[59],"revenue":[60],"(i.e.,":[61],"least":[62],"regret),":[63],"needs":[66],"learn":[68],"exploit":[70],"GLMs":[73],"while":[74],"monitoring":[75],"potential":[77],"changes.":[78],"propose":[80],"multiscale":[82],"change-point":[83],"detection":[84],"based":[85],"algorithm":[86,118,139,204,223],"achieves":[88,149],"regret":[90,188],"of":[91,99,110,114,146,202,220],"order":[92],"$\\widetilde{O}(\\sqrt{s_TdT}\\wedge\\{V_T^{1/3}d^{1/3}T^{2/3}+\\sqrt{dT}\\})$,":[93],"$s_T$":[95,126],"number":[98],"piecewise":[100],"stationary":[101],"segments":[102],"$V_T$":[104],"newly":[107,194],"defined":[108],"notion":[109],"design-adjusted":[111],"variation":[112],"budget":[113],"parameters.":[116],"Our":[117],"adaptive":[120,142,173],"does":[122],"not":[123],"require":[124],"knowing":[125],"or":[127],"$V_T$.":[128],"Moreover,":[129],"our":[131,203],"knowledge,":[132],"this":[133],"first":[136],"nature":[145],"changes":[147],"best-of-both-worlds":[151],"rate,":[152],"thus":[153],"closing":[154],"long-standing":[156],"gap":[157],"literature.":[160],"remark":[162],"that,":[163],"due":[164],"varying":[167],"contexts,":[168],"existing":[169],"works":[170],"non-stationary":[174,225],"bandit":[175],"literature":[176],"cannot":[177],"applied":[179],"optimality":[182,201],"pricing.":[186,227],"further":[190],"accompanied":[191],"with":[192],"constructed":[195],"minimax":[196],"lower":[197],"bound,":[198],"confirming":[199],"(up":[205],"logarithmic":[207],"factors).":[208],"Extensive":[209],"numerical":[210],"experiments":[211],"are":[212],"conducted":[213],"illustrate":[215],"efficiency":[217],"robustness":[219],"proposed":[222]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2026-07-29T00:00:00"}