{"id":"https://openalex.org/W2962701488","doi":"https://doi.org/10.48550/arxiv.1803.10415","title":"A Better Resource Allocation Algorithm with Semi-Bandit Feedback","display_name":"A Better Resource Allocation Algorithm with Semi-Bandit Feedback","alternate_titles":[],"publication_year":2018,"publication_date":"2018-03-28","ids":{"openalex":"https://openalex.org/W2962701488","doi":"https://doi.org/10.48550/arxiv.1803.10415","mag":"2962701488"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1803.10415","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.10415","pdf_url":"https://arxiv.org/pdf/1803.10415","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,"listed_in":[],"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"},"parent_works":[],"lineage":["https://openalex.org/W2962701488"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1803.10415","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Dagan, Yuval","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Dagan, Yuval","raw_affiliation_strings":["Technion -Israel Institute of Technology ,","Technion \u2013 Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion -Israel Institute of Technology ,","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion \u2013 Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006419939","display_name":"Koby Crammer","orcid":"https://orcid.org/0000-0001-8824-5747","observed_orcids":["https://orcid.org/0000-0001-8824-5747"]},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Crammer, Koby","raw_affiliation_strings":["Technion -Israel Institute of Technology ,","Technion \u2013 Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion -Israel Institute of Technology ,","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion \u2013 Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":16,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"268","last_page":"320"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":1.0,"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":1.0,"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.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.0,"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/sequential-resource-allocation","display_name":"sequential resource allocation","score":0.8199999928474426},{"id":"https://openalex.org/keywords/multi-armed-bandits","display_name":"multi-armed bandits","score":0.777999997138977},{"id":"https://openalex.org/keywords/semi-bandit-feedback","display_name":"semi-bandit feedback","score":0.9779999852180481},{"id":"https://openalex.org/keywords/regret-bounds","display_name":"regret bounds","score":0.8989999890327454},{"id":"https://openalex.org/keywords/regret-lower-bounds","display_name":"regret lower bounds","score":0.6990000009536743},{"id":"https://openalex.org/keywords/logarithmic-regret","display_name":"logarithmic regret","score":0.5170000195503235}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8586452007293701},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7955524921417236},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.6033846735954285},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5413761734962463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5067985653877258},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5053101181983948},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.45907139778137207},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.43524667620658875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42549753189086914},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33686619997024536},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.1537519097328186},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13743239641189575},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:1803.10415","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.10415","pdf_url":"https://arxiv.org/pdf/1803.10415","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,"listed_in":[],"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"},{"id":"doi:10.48550/arxiv.1803.10415","doi":"https://doi.org/10.48550/arxiv.1803.10415","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1803.10415","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,"listed_in":[],"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":"Preprint"},{"id":"mag:2962701488","doi":null,"is_oa":false,"landing_page_url":"http://proceedings.mlr.press/v83/dagan18a/dagan18a.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306417654","display_name":"Algorithmic Learning Theory","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Algorithmic Learning Theory","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1803.10415","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1803.10415","pdf_url":"https://arxiv.org/pdf/1803.10415","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,"listed_in":[],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2962701488.pdf","grobid_xml":"https://content.openalex.org/works/W2962701488.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W2042587503","https://openalex.org/W2119738618","https://openalex.org/W2130520598","https://openalex.org/W2166253248","https://openalex.org/W2168405694"],"related_works":["https://openalex.org/W241755495","https://openalex.org/W2189148180","https://openalex.org/W7128354156","https://openalex.org/W3157742101","https://openalex.org/W4415191840","https://openalex.org/W7147089501","https://openalex.org/W2970142505","https://openalex.org/W3153959502","https://openalex.org/W3097146586","https://openalex.org/W4241632454"],"abstract_inverted_index":{"We":[0,51,87],"study":[1],"a":[2,8,19,38,49,96],"sequential":[3],"resource":[4,20,36,74],"allocation":[5],"problem":[6,93],"between":[7],"fixed":[9,81],"number":[10],"of":[11,34,72,100,109,127],"arms.":[12],"On":[13],"each":[14],"iteration":[15],"the":[16,22,28,35,42,60,73,85,105,125],"algorithm":[17,90],"distributes":[18],"among":[21],"arms":[23],"in":[24],"order":[25],"to":[26,37,84],"maximize":[27],"expected":[29],"success":[30],"rate.":[31],"Allocating":[32],"more":[33,71],"given":[39],"arm":[40],"increases":[41,62],"probability":[43,61],"that":[44,59,117],"it":[45,65],"succeeds,":[46],"yet":[47],"with":[48],"cut-off.":[50],"follow":[52],"Lattimore":[53],"et":[54],"al.":[55],"(2014)":[56],"and":[57,82,94],"assume":[58],"linearly":[63],"until":[64],"equals":[66],"one,":[67],"after":[68],"which":[69],"allocating":[70],"is":[75,121],"wasteful.":[76],"These":[77],"cut-off":[78],"values":[79],"are":[80],"unknown":[83],"learner.":[86],"present":[88],"an":[89],"for":[91],"this":[92],"prove":[95,115],"regret":[97],"upper":[98,119],"bound":[99,108,120],"$O(\\log":[101],"n)$":[102],"improving":[103],"over":[104],"best":[106],"known":[107],"$O(\\log^2":[110],"n)$.":[111],"Lower":[112],"bounds":[113],"we":[114],"show":[116],"our":[118,128],"tight.":[122],"Simulations":[123],"demonstrate":[124],"superiority":[126],"algorithm.":[129]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2962701488","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2019-07-30T00:00:00"}
