{"id":"https://openalex.org/W7166554071","doi":"https://doi.org/10.48550/arxiv.2606.28059","title":"Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization","display_name":"Fast and Feasible: Permutation-based Constrained Reranking for Revenue Maximization","publication_year":2026,"publication_date":"2026-06-26","ids":{"openalex":"https://openalex.org/W7166554071","doi":"https://doi.org/10.48550/arxiv.2606.28059"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.28059","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28059","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.2606.28059","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087925379","display_name":"Svetlana Shirokovskikh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shirokovskikh, Svetlana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139585071","display_name":"Anastasiia Soboleva","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Soboleva, Anastasiia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139602548","display_name":"Ekaterina Solodneva","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Solodneva, Ekaterina","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120372452","display_name":"Aleksandr Katrutsa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Katrutsa, Aleksandr","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120559978","display_name":"Roman Loginov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Loginov, Roman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137316736","display_name":"Egor Samosvat","orcid":"https://orcid.org/0000-0003-3399-4235"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samosvat, Egor","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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.3370000123977661,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.3370000123977661,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.2809999883174896,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11106","display_name":"Data Management and Algorithms","score":0.05889999866485596,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/revenue","display_name":"Revenue","score":0.8194000124931335},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.5799999833106995},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4311999976634979},{"id":"https://openalex.org/keywords/software-deployment","display_name":"Software deployment","score":0.43070000410079956},{"id":"https://openalex.org/keywords/production","display_name":"Production (economics)","score":0.38989999890327454},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.3668999969959259},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.36000001430511475},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.33500000834465027}],"concepts":[{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.8194000124931335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6912000179290771},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.5799999833106995},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.43070000410079956},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3799000084400177},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.36000001430511475},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C91887955","wikidata":"https://www.wikidata.org/wiki/Q5362092","display_name":"Revenue model","level":3,"score":0.3278999924659729},{"id":"https://openalex.org/C98147612","wikidata":"https://www.wikidata.org/wiki/Q215599","display_name":"Promotion (chess)","level":3,"score":0.32429999113082886},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.31949999928474426},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.28769999742507935},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.27880001068115234},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.28059","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28059","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.2606.28059","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.28059","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":[{"score":0.6273942589759827,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Search":[0],"and":[1,113,139],"recommender":[2],"systems":[3,19],"have":[4],"produced":[5],"highly":[6],"relevant":[7],"search":[8,167],"results.":[9],"A":[10],"natural":[11],"next":[12],"step":[13],"in":[14,20,137],"the":[15,29,42,57,90,105,119,147],"development":[16],"of":[17,110,132,146],"such":[18],"e-commerce":[21],"is":[22,85],"to":[23,27,70,89,116],"rerank":[24],"these":[25],"results":[26],"increase":[28],"platform's":[30],"revenue":[31,38,68,149,171],"from":[32],"paid":[33],"promotion":[34],"products.":[35],"However,":[36],"maximizing":[37],"alone":[39],"may":[40],"degrade":[41],"user":[43],"experience":[44],"by":[45,172],"reducing":[46],"relevance":[47],"or":[48,121],"increasing":[49],"fraud":[50],"risk.":[51],"To":[52],"avoid":[53],"this,":[54],"we":[55,93],"state":[56],"reranking":[58,98],"problem":[59],"as":[60],"an":[61],"integer":[62],"linear":[63],"program":[64],"($ILP$)":[65],"that":[66],"maximizes":[67],"subject":[69],"per-query":[71],"constraints":[72],"on":[73],"other":[74],"metrics,":[75],"e.g.,":[76],"relevance.":[77],"Since":[78],"solving":[79],"$ILP$":[80],"exactly":[81],"for":[82,87],"every":[83],"query":[84],"slow":[86],"deployment":[88],"online":[91,140,161],"service,":[92],"propose":[94],"a":[95,108,123,133,159],"lightweight":[96],"permutation-based":[97],"approximation":[99],"algorithm":[100,106],"PermR.":[101],"At":[102],"each":[103],"step,":[104],"selects":[107],"pair":[109],"neighboring":[111],"items":[112],"swaps":[114],"them":[115],"either":[117],"improve":[118],"objective":[120],"repair":[122],"violated":[124],"constraint.":[125],"We":[126],"evaluate":[127],"PermR":[128,142,169],"across":[129],"multiple":[130],"categories":[131],"large":[134],"classified":[135],"platform":[136],"offline":[138],"settings.":[141],"achieves":[143],"about":[144],"63\\%":[145],"ILP":[148],"improvement,":[150],"within":[151],"production":[152],"latency":[153],"limits,":[154],"preserving":[155],"all":[156],"constraints.":[157],"In":[158],"14-day":[160],"A/B":[162],"test":[163],"over":[164],"56":[165],"million":[166],"queries,":[168],"increased":[170],"$2$\\%.":[173]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-30T00:00:00"}