{"id":"https://openalex.org/W3150297952","doi":"https://doi.org/10.1109/cec.2009.4983142","title":"Estimating optimal stopping rules in the multiple best choice problem with minimal summarized rank via the Cross-Entropy method","display_name":"Estimating optimal stopping rules in the multiple best choice problem with minimal summarized rank via the Cross-Entropy method","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W3150297952","doi":"https://doi.org/10.1109/cec.2009.4983142","mag":"3150297952"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-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/A5069192564","display_name":"Tatiana Polushina","orcid":null},"institutions":[{"id":"https://openalex.org/I3132405765","display_name":"Mari State University","ror":"https://ror.org/01yjw8d43","country_code":"RU","type":"education","lineage":["https://openalex.org/I3132405765"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"T. V. Polushina","raw_affiliation_strings":["Department of Physics and Mathematics, Mari State University, Yoshkar-Ola, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Physics and Mathematics, Mari State University, Yoshkar-Ola, Russia","institution_ids":["https://openalex.org/I3132405765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069192564"],"corresponding_institution_ids":["https://openalex.org/I3132405765"],"apc_list":null,"apc_paid":null,"fwci":0.3428,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.69559831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":null,"first_page":"1668","last_page":"1674"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"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":0.9986000061035156,"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.9854999780654907,"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/T11182","display_name":"Auction Theory and Applications","score":0.9484000205993652,"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/cross-entropy","display_name":"Cross entropy","score":0.7481637001037598},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.6616319417953491},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.5865908265113831},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5829819440841675},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5492241382598877},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5064119100570679},{"id":"https://openalex.org/keywords/stopping-rule","display_name":"Stopping rule","score":0.47924259305000305},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4536116421222687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43681299686431885},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4228248596191406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32308700680732727},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.27513355016708374},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.23526209592819214},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19437915086746216},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12743422389030457}],"concepts":[{"id":"https://openalex.org/C167981619","wikidata":"https://www.wikidata.org/wiki/Q1685498","display_name":"Cross entropy","level":3,"score":0.7481637001037598},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.6616319417953491},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.5865908265113831},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5829819440841675},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5492241382598877},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5064119100570679},{"id":"https://openalex.org/C2983961125","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping rule","level":2,"score":0.47924259305000305},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4536116421222687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43681299686431885},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4228248596191406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32308700680732727},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.27513355016708374},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.23526209592819214},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19437915086746216},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12743422389030457},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2009.4983142","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W808046","https://openalex.org/W1502364872","https://openalex.org/W1599267017","https://openalex.org/W2011781744","https://openalex.org/W2033904669","https://openalex.org/W2056020109","https://openalex.org/W2072978456","https://openalex.org/W2121139413","https://openalex.org/W2163557122","https://openalex.org/W2318812627","https://openalex.org/W2491514954","https://openalex.org/W3015897189","https://openalex.org/W4231302157","https://openalex.org/W4233464598"],"related_works":["https://openalex.org/W2080931671","https://openalex.org/W2073844031","https://openalex.org/W1584645679","https://openalex.org/W2400292122","https://openalex.org/W2770616710","https://openalex.org/W2077756842","https://openalex.org/W2052147111","https://openalex.org/W2140599579","https://openalex.org/W2332008978","https://openalex.org/W3150297952"],"abstract_inverted_index":{"The":[0],"best":[1,27],"choice":[2,28],"problem":[3,29],"is":[4,45],"an":[5],"important":[6],"class":[7],"of":[8,11,35],"the":[9,20,25,31,42],"theory":[10],"optimal":[12],"stopping":[13],"rules.":[14],"In":[15],"this":[16],"article,":[17],"we":[18],"present":[19],"cross-entropy":[21,43],"method":[22,44],"for":[23],"solving":[24],"multiple":[26],"with":[30],"minimal":[32],"expected":[33],"ranks":[34],"selected":[36],"objects.":[37],"Computational":[38],"results":[39],"showed":[40],"that":[41],"producing":[46],"high-quality":[47],"solution.":[48]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}