{"id":"https://openalex.org/W1978349908","doi":"https://doi.org/10.1109/tit.1978.1055854","title":"On finite memory solutions to the two-armed bandit problem (Corresp.)","display_name":"On finite memory solutions to the two-armed bandit problem (Corresp.)","publication_year":1978,"publication_date":"1978-03-01","ids":{"openalex":"https://openalex.org/W1978349908","doi":"https://doi.org/10.1109/tit.1978.1055854","mag":"1978349908"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1978.1055854","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1978.1055854","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025099834","display_name":"K. Lakshmanan","orcid":null},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Lakshmanan","raw_affiliation_strings":["Department of Computer and Information Science, Ohio State Uinversity, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Ohio State Uinversity, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078681192","display_name":"Bharath Chandrasekaran","orcid":"https://orcid.org/0000-0002-3673-9435"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"B. Chandrasekaran","raw_affiliation_strings":["Department of Computer and Information Science, Ohio State Uinversity, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Ohio State Uinversity, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025099834"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":0.6937,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.66708582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"2","first_page":"244","last_page":"248"},"is_retracted":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.9993000030517578,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9965000152587891,"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/limiting","display_name":"Limiting","score":0.7459808588027954},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5794873237609863},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5749369263648987},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.486407995223999},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4332542419433594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4249873161315918},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3793220520019531},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3422528803348541},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3340630829334259},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32071515917778015}],"concepts":[{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.7459808588027954},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5794873237609863},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5749369263648987},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.486407995223999},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4332542419433594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4249873161315918},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3793220520019531},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3422528803348541},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3340630829334259},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32071515917778015},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1978.1055854","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1978.1055854","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1516020365","https://openalex.org/W1969061574","https://openalex.org/W1980974949","https://openalex.org/W1993664169","https://openalex.org/W1998498767","https://openalex.org/W2000114801","https://openalex.org/W2021376966","https://openalex.org/W2051429016","https://openalex.org/W2111941176","https://openalex.org/W2124402837","https://openalex.org/W2299990356","https://openalex.org/W4245448682"],"related_works":["https://openalex.org/W2029404707","https://openalex.org/W4285325679","https://openalex.org/W1928239295","https://openalex.org/W4282982070","https://openalex.org/W2487963770","https://openalex.org/W1507176903","https://openalex.org/W3193624333","https://openalex.org/W4312340169","https://openalex.org/W4285129633","https://openalex.org/W2476662226"],"abstract_inverted_index":{"The":[0],"least":[1],"upper":[2],"bound":[3],"on":[4],"the":[5,9,12],"asymptotic":[6],"proportion":[7],"of":[8,11],"choice":[10],"correct":[13],"coin,":[14],"achievable":[15],"by":[16],"{\\em":[17],"expedient}":[18],"finite-memory":[19],"algorithms":[20],"in":[21,34],"certain":[22],"two-armed":[23],"bandit":[24],"problems,":[25],"is":[26,45,49],"derived":[27],"and":[28],"schemes":[29],"which":[30],"achieve":[31],"these":[32],"bounds":[33],"a":[35],"limiting":[36],"sense":[37],"are":[38],"displayed.":[39],"A":[40],"deterministic":[41],"automaton":[42],"whose":[43],"performance":[44],"close":[46],"to":[47],"optimal":[48],"also":[50],"presented.":[51]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}