{"id":"https://openalex.org/W7160644882","doi":"https://doi.org/10.48550/arxiv.2605.06106","title":"The Pareto Frontier of Randomized Learning-Augmented Online Bidding","display_name":"The Pareto Frontier of Randomized Learning-Augmented Online Bidding","publication_year":2026,"publication_date":"2026-05-07","ids":{"openalex":"https://openalex.org/W7160644882","doi":"https://doi.org/10.48550/arxiv.2605.06106"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05618414v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05618414","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"Preprints, Working Papers, ..."},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.06106","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135709434","display_name":"Mathis Degryse","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Degryse, Mathis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135680163","display_name":"Imrane Saakour","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saakour, Imrane","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029270613","display_name":"Christoph D\u00fcrr","orcid":"https://orcid.org/0000-0001-8103-5333"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D\u00fcrr, Christoph","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5107303715","display_name":"Spyros Angelopoulos","orcid":"https://orcid.org/0000-0001-9819-9158"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Angelopoulos, Spyros","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.37610000371932983,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.37610000371932983,"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/T12288","display_name":"Optimization and Search Problems","score":0.13179999589920044,"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.11949999630451202,"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/bidding","display_name":"Bidding","score":0.8495000004768372},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.4453999996185303},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4375},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4339999854564667},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.40950000286102295},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.39559999108314514},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.388700008392334},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.38179999589920044},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.35040000081062317}],"concepts":[{"id":"https://openalex.org/C9233905","wikidata":"https://www.wikidata.org/wiki/Q3276328","display_name":"Bidding","level":2,"score":0.8495000004768372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5455999970436096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4546999931335449},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4453999996185303},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4375},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4339999854564667},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.40950000286102295},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.38179999589920044},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.35040000081062317},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C155108698","wikidata":"https://www.wikidata.org/wiki/Q1231081","display_name":"Randomized experiment","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.29109999537467957},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C51485801","wikidata":"https://www.wikidata.org/wiki/Q16966861","display_name":"Efficient frontier","level":3,"score":0.28760001063346863},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26249998807907104},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.2619999945163727},{"id":"https://openalex.org/C2778599509","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto efficiency","level":3,"score":0.26170000433921814},{"id":"https://openalex.org/C87466663","wikidata":"https://www.wikidata.org/wiki/Q5157537","display_name":"Computer experiment","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.251800000667572},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:HAL:hal-05618414v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05618414","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"Preprints, Working Papers, ..."},{"id":"doi:10.48550/arxiv.2605.06106","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06106","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.2605.06106","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06106","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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7497541904449463}],"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],"bidding":[1,86,103,116],"is":[2,81],"a":[3,33,57,85,88,93],"classical":[4],"problem":[5],"in":[6,11,128],"online":[7,30],"decision-making,":[8],"with":[9,110],"applications":[10],"resource":[12],"allocation,":[13],"hierarchical":[14],"clustering,":[15],"and":[16,48,99],"the":[17,52,60,71,82,97,118,123],"analysis":[18,100],"of":[19,35,59,84,101,114,125],"approximation":[20],"algorithms.":[21],"We":[22,44,105],"study":[23],"its":[24],"randomized":[25,102,115],"learning-augmented":[26],"variant,":[27],"where":[28],"an":[29,42,111],"algorithm":[31,127],"generates":[32],"sequence":[34],"random":[36],"bids":[37],"while":[38],"leveraging":[39],"predictions":[40],"from":[41],"oracle.":[43],"provide":[45],"analytical":[46],"upper":[47],"lower":[49],"bounds":[50],"on":[51],"optimal":[53],"consistency":[54],"$C$":[55],"as":[56],"function":[58],"robustness":[61],"$R$,":[62],"which":[63],"match":[64],"when":[65],"$R":[66],"\\geq":[67],"2.885$,":[68],"effectively":[69],"closing":[70],"gap":[72],"left":[73],"by":[74],"previous":[75],"work.":[76],"The":[77],"key":[78],"technical":[79],"ingredient":[80],"notion":[83],"function,":[87],"novel":[89],"abstraction":[90],"that":[91],"provides":[92],"unified":[94],"framework":[95],"for":[96],"design":[98],"strategies.":[104],"complement":[106],"our":[107,126],"theoretical":[108],"results":[109],"experimental":[112],"application":[113],"to":[117],"incremental":[119],"median":[120],"problem,":[121],"demonstrating":[122],"applicability":[124],"practical":[129],"clustering":[130],"settings.":[131]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-09T00:00:00"}