{"id":"https://openalex.org/W2018967933","doi":"https://doi.org/10.1145/2764468.2764482","title":"Near-Optimum Online Ad Allocation for Targeted Advertising","display_name":"Near-Optimum Online Ad Allocation for Targeted Advertising","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2018967933","doi":"https://doi.org/10.1145/2764468.2764482","mag":"2018967933"},"language":"en","primary_location":{"id":"doi:10.1145/2764468.2764482","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764468.2764482","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1409.8670","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Joseph (Seffi) Naor","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Technion, Haifa, PA, USA"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, PA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"David Wajc","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Wajc","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7518,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.86520442,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"131","last_page":"148"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T11182","display_name":"Auction Theory and Applications","score":0.9969000220298767,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9857000112533569,"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/competitive-analysis","display_name":"Competitive analysis","score":0.6909000277519226},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6747000217437744},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.6661999821662903},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6353999972343445},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5896999835968018},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5683000087738037},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5612999796867371},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5200999975204468},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.491100013256073}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6909000277519226},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6747000217437744},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6661999821662903},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6353999972343445},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5896999835968018},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5683000087738037},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5612999796867371},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5200999975204468},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.491100013256073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48539999127388},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4659000039100647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45730000734329224},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4180000126361847},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3862999975681305},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3668000102043152},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.357699990272522},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3506999909877777},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.34299999475479126},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.33329999446868896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3287000060081482},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.3151000142097473},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30640000104904175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3052999973297119},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.2567000091075897},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2764468.2764482","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764468.2764482","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1409.8670","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.8670","pdf_url":"https://arxiv.org/pdf/1409.8670","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1409.8670","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1409.8670","pdf_url":"https://arxiv.org/pdf/1409.8670","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5208165871","display_name":null,"funder_award_id":"2010-246","funder_id":"https://openalex.org/F4320308960","funder_display_name":"United States - Israel Binational Science Foundation"},{"id":"https://openalex.org/G7315415636","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G990861464","display_name":null,"funder_award_id":"954/11","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320308960","display_name":"United States - Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2018967933.pdf"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W205662698","https://openalex.org/W1496647032","https://openalex.org/W1542279226","https://openalex.org/W2015324401","https://openalex.org/W2029945631","https://openalex.org/W2048837158","https://openalex.org/W2079669094","https://openalex.org/W2085938855","https://openalex.org/W2101199730","https://openalex.org/W2104224720","https://openalex.org/W2131951207","https://openalex.org/W2158268067","https://openalex.org/W2162656786","https://openalex.org/W2170675255","https://openalex.org/W2571343094","https://openalex.org/W4247154108","https://openalex.org/W4250340495"],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1,49,58,179],"Internet":[2],"targeted":[3],"advertising,":[4],"we":[5,65,127,172,215],"address":[6],"several":[7],"ad":[8,198],"allocation":[9,199],"problems.":[10,273],"Prior":[11],"work":[12],"has":[13],"established":[14],"these":[15,100,124],"problems":[16,135],"admit":[17],"no":[18],"randomized":[19,183],"online":[20,76,240,271],"algorithm":[21],"better":[22,42,142,151],"than":[23,152],"(1-1/e)-competitive":[24],"([Karp":[25],"et":[26,30,60],"al.":[27,31,61],"1990;":[28],"Mehta":[29],"2007]),":[32],"yet":[33],"simple":[34,182],"heuristics":[35],"have":[36,227],"been":[37],"observed":[38],"to":[39,110,115,177,219,268],"perform":[40],"much":[41,230],"in":[43,189],"practice.":[44],"We":[45,94,117,158,261],"explain":[46],"this":[47,119],"phenomenon":[48],"studying":[50],"a":[51,145],"generalization":[52],"of":[53,147,210,222],"the":[54,71,75,83,87,133,168,186,207,220,224],"bounded-degree":[55],"inputs":[56],"considered":[57],"[Buchbinder":[59],"2007),":[62],"graphs":[63,70],"which":[64,201],"call":[66],"(k,d)-bounded.":[67],"In":[68],"such":[69,98],"maximal":[72],"degree":[73,85],"on":[74,86,206],"side":[77,89],"is":[78,90,121],"at":[79,91],"most":[80],"d":[81],"and":[82,149,193,254],"minimal":[84],"offline":[88],"least":[92],"k.":[93],"prove":[95,118,178],"that":[96,181],"for":[97,123,132,167],"graphs,":[99],"problems'":[101],"natural":[102],"greedy":[103],"algorithms":[104,131,176,184,192,236],"attain":[105,256],"competitive":[106,137],"ratio":[107,138],"1-(d-1)/(k+d-1),":[108],"tending":[109],"one":[111],"as":[112,144,229,231,243],"d/k":[113],"tends":[114],"zero.":[116],"bound":[120],"tight":[122],"algorithms.":[125],"Next,":[126],"develop":[128],"deterministic":[129,175],"primal-dual":[130,241],"above":[134],"achieving":[136],"1-(1-1/d)k>1-1/ek/d,":[139],"or":[140],"exponentially":[141],"loss":[143],"function":[146],"k/d,":[148],"strictly":[150],"1-1/e":[153],"whenever":[154],"k":[155],"\u2265":[156],"d.":[157],"complement":[159],"our":[160,174,263],"lower":[161],"bounds":[162,166,188],"with":[163],"matching":[164],"upper":[165],"vertex-weighted":[169],"problem.":[170],"Finally,":[171],"use":[173],"dual-fitting":[180],"achieve":[185],"same":[187],"expectation.":[190],"Our":[191,235],"analysis":[194],"differ":[195,237],"from":[196,238],"previous":[197,239],"algorithms,":[200,242],"largely":[202],"scale":[203,216],"bids":[204,217],"based":[205],"spent":[208,228],"fraction":[209],"their":[211],"bidder's":[212],"budget,":[213],"whereas":[214],"according":[218],"number":[221],"times":[223],"bidder":[225],"could":[226,265],"her":[232],"current":[233],"bid.":[234],"they":[244],"do":[245],"not":[246],"maintain":[247],"dual":[248,257],"feasibility,":[249],"but":[250],"only":[251,255],"primal-to-dual":[252],"ratio,":[253],"feasibility":[258],"upon":[259],"termination.":[260],"believe":[262],"techniques":[264],"find":[266],"applications":[267],"other":[269],"well-behaved":[270],"packing":[272]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2016-06-24T00:00:00"}