{"id":"https://openalex.org/W7130509434","doi":"https://doi.org/10.1007/s00453-026-01369-5","title":"Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids","display_name":"Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids","publication_year":2026,"publication_date":"2026-02-19","ids":{"openalex":"https://openalex.org/W7130509434","doi":"https://doi.org/10.1007/s00453-026-01369-5"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-026-01369-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01369-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01369-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01369-5.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126379677","display_name":"Vijay V. Vazirani","orcid":null},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vijay V. Vazirani","raw_affiliation_strings":["University of California, Irvine, Irvine, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, USA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5126379677"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.59538128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.5060999989509583,"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/T11182","display_name":"Auction Theory and Applications","score":0.5060999989509583,"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/T12288","display_name":"Optimization and Search Problems","score":0.2703000009059906,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.14640000462532043,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6215999722480774},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5922999978065491},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5781999826431274},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5598000288009644},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.5303999781608582},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5152999758720398},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4352000057697296},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4138999879360199}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6240000128746033},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6215999722480774},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5922999978065491},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5781999826431274},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5598000288009644},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.5303999781608582},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5152999758720398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48330000042915344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4404999911785126},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4352000057697296},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4138999879360199},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4108999967575073},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39719998836517334},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3391000032424927},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.30309998989105225},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2565000057220459},{"id":"https://openalex.org/C34628019","wikidata":"https://www.wikidata.org/wiki/Q13636890","display_name":"Algorithmics","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-026-01369-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01369-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01369-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-026-01369-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01369-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01369-5.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7130509434.pdf","grobid_xml":"https://content.openalex.org/works/W7130509434.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1496647032","https://openalex.org/W2048837158","https://openalex.org/W2052494364","https://openalex.org/W2068115726","https://openalex.org/W2085938855","https://openalex.org/W2131951207","https://openalex.org/W2162656786","https://openalex.org/W2949565166","https://openalex.org/W2990583325","https://openalex.org/W3126370525","https://openalex.org/W4240320731","https://openalex.org/W4250340495"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Motivated":[1],"by":[2],"recent":[3],"insights":[4],"into":[5],"the":[6,19,28,31,48,77,119,124,140,146],"online":[7],"bipartite":[8],"matching":[9],"problem":[10,148],"(":[11],"OBM":[12],"),":[13],"our":[14,128],"goal":[15],"was":[16],"to":[17,30,46,82,112],"extend":[18],"optimal":[20],"algorithm":[21,74,78,99,129],"for":[22,100],"it,":[23],"namely":[24],"Ranking":[25],",":[26,39,75,102],"all":[27],"way":[29],"special":[32,104],"case":[33,105],"of":[34,52,85,106,116,118,149],"adwords":[35],"problem,":[36],"called":[37],"Small":[38,107,113],"in":[40,56,62,92],"which":[41],"bids":[42],"are":[43,130],"small":[44],"compared":[45],"budgets;":[47],"latter":[49],"has":[50],"been":[51],"considerable":[53],"practical":[54],"significance":[55],"ad":[57],"auctions":[58],"(Mehta":[59],"et":[60],"al.":[61],"J.":[63],"ACM":[64],"(JACM)":[65],"54:22-es,":[66],"2007).":[67],"This":[68],"approach":[69],"would":[70,79],"yield":[71],"a":[72,103],"budget-oblivious":[73],"i.e.,":[76],"not":[80],"need":[81],"know":[83],"budgets":[84],"advertisers":[86],"and":[87,143],"therefore":[88],"could":[89],"be":[90],"used":[91],"autobidding":[93],"platforms.":[94],"We":[95],"present":[96],"such":[97],"an":[98,110],"Single-Valued":[101],".":[108,122],"However,":[109],"extension":[111],"failed":[114],"because":[115],"failure":[117],"No-Surpassing":[120,141],"Property":[121],"Since":[123],"probabilistic":[125],"ideas":[126],"underlying":[127],"quite":[131],"substantial,":[132],"we":[133,144],"have":[134],"stated":[135],"them":[136],"formally,":[137],"after":[138],"assuming":[139],"Property,":[142],"leave":[145],"open":[147],"removing":[150],"this":[151],"assumption.":[152]},"counts_by_year":[],"updated_date":"2026-03-13T14:20:09.374765","created_date":"2026-02-19T00:00:00"}