{"id":"https://openalex.org/W2039516355","doi":"https://doi.org/10.1137/09076845x","title":"How to Choose the Best Twins","display_name":"How to Choose the Best Twins","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2039516355","doi":"https://doi.org/10.1137/09076845x","mag":"2039516355"},"language":"en","primary_location":{"id":"doi:10.1137/09076845x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/09076845x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5077460412","display_name":"Bryn Garrod","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bryn Garrod","raw_affiliation_strings":["b.garrod@dpmms.cam.ac.uk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"b.garrod@dpmms.cam.ac.uk#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103031015","display_name":"Grzegorz Kubicki","orcid":"https://orcid.org/0000-0002-5531-167X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grzegorz Kubicki","raw_affiliation_strings":["gkubicki@louisville.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"gkubicki@louisville.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033991835","display_name":"Micha\u0142 Morayne","orcid":"https://orcid.org/0000-0002-9856-479X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Micha\u0142 Morayne","raw_affiliation_strings":["michal.morayne@pwr.wroc.pl#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"michal.morayne@pwr.wroc.pl#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077460412"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.3535,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.92576054,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"26","issue":"1","first_page":"384","last_page":"398"},"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.9944999814033508,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7161520719528198},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.7009111642837524},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5259419083595276},{"id":"https://openalex.org/keywords/secretary-problem","display_name":"Secretary problem","score":0.4940372109413147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39520347118377686},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3347506523132324}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7161520719528198},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.7009111642837524},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5259419083595276},{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.4940372109413147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39520347118377686},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3347506523132324}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/09076845x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/09076845x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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":7,"referenced_works":["https://openalex.org/W2002373756","https://openalex.org/W2019516620","https://openalex.org/W2051231039","https://openalex.org/W2085480884","https://openalex.org/W2797720335","https://openalex.org/W3083114581","https://openalex.org/W4241697062"],"related_works":["https://openalex.org/W3105682563","https://openalex.org/W4366194058","https://openalex.org/W2351073469","https://openalex.org/W3185930343","https://openalex.org/W2977579341","https://openalex.org/W2848857299","https://openalex.org/W2035209978","https://openalex.org/W2042777133","https://openalex.org/W1530564689","https://openalex.org/W2157679251"],"abstract_inverted_index":{"We":[0,39],"consider":[1],"a":[2,30,47],"version":[3],"of":[4,35,51],"the":[5,19,26,36,49,53],"secretary":[6],"problem":[7],"where":[8],"each":[9],"candidate":[10],"has":[11],"an":[12,41],"identical":[13],"twin.":[14],"The":[15],"aim,":[16],"as":[17],"in":[18],"classical":[20],"problem,":[21],"is":[22],"to":[23],"choose":[24],"with":[25],"largest":[27],"possible":[28],"probability":[29,50],"top":[31],"candidate,":[32],"i.e.,":[33],"one":[34],"best":[37],"twins.":[38],"find":[40],"optimal":[42,54],"stopping":[43,55],"time":[44,56],"for":[45],"such":[46],"choice,":[48],"success":[52],"yields,":[57],"and":[58],"their":[59],"asymptotic":[60],"behavior.":[61]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}