HOW TO CHOOSE THE BEST TWINS.
Saved in:
| Title: | HOW TO CHOOSE THE BEST TWINS. |
|---|---|
| Authors: | Garrod, Bryn1 b.garrod@dpmms.cam.ac.uk, Kubicki, Grzegorz2 gkubicki@louisville.edu, Morayne, Michal3 michal.morayne@pwr.wroc.pl |
| Source: | SIAM Journal on Discrete Mathematics. 2012, Vol. 26 Issue 1, p384-398. 15p. 2 Diagrams. |
| Subjects: | Secretary problem (Probability theory), Famous problems in probabilities, Twins, Optimal stopping (Mathematical statistics), Asymptotic distribution |
| Abstract: | We consider a version of the secretary problem where each candidate has an identical twin. The aim, as in the classical problem, is to choose with the largest possible probability a top candidate, i.e., one of the best twins. We find an optimal stopping time for such a choice, the probability of success the optimal stopping time yields, and their asymptotic behavior. [ABSTRACT FROM AUTHOR] |
| Copyright of SIAM Journal on Discrete Mathematics is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 76622324 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: HOW TO CHOOSE THE BEST TWINS. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Garrod%2C+Bryn%22">Garrod, Bryn</searchLink><relatesTo>1</relatesTo><i> b.garrod@dpmms.cam.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Kubicki%2C+Grzegorz%22">Kubicki, Grzegorz</searchLink><relatesTo>2</relatesTo><i> gkubicki@louisville.edu</i><br /><searchLink fieldCode="AR" term="%22Morayne%2C+Michal%22">Morayne, Michal</searchLink><relatesTo>3</relatesTo><i> michal.morayne@pwr.wroc.pl</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22SIAM+Journal+on+Discrete+Mathematics%22">SIAM Journal on Discrete Mathematics</searchLink>. 2012, Vol. 26 Issue 1, p384-398. 15p. 2 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Secretary+problem+%28Probability+theory%29%22">Secretary problem (Probability theory)</searchLink><br /><searchLink fieldCode="DE" term="%22Famous+problems+in+probabilities%22">Famous problems in probabilities</searchLink><br /><searchLink fieldCode="DE" term="%22Twins%22">Twins</searchLink><br /><searchLink fieldCode="DE" term="%22Optimal+stopping+%28Mathematical+statistics%29%22">Optimal stopping (Mathematical statistics)</searchLink><br /><searchLink fieldCode="DE" term="%22Asymptotic+distribution%22">Asymptotic distribution</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We consider a version of the secretary problem where each candidate has an identical twin. The aim, as in the classical problem, is to choose with the largest possible probability a top candidate, i.e., one of the best twins. We find an optimal stopping time for such a choice, the probability of success the optimal stopping time yields, and their asymptotic behavior. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of SIAM Journal on Discrete Mathematics is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=76622324 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1137/09076845X Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 15 StartPage: 384 Subjects: – SubjectFull: Secretary problem (Probability theory) Type: general – SubjectFull: Famous problems in probabilities Type: general – SubjectFull: Twins Type: general – SubjectFull: Optimal stopping (Mathematical statistics) Type: general – SubjectFull: Asymptotic distribution Type: general Titles: – TitleFull: HOW TO CHOOSE THE BEST TWINS. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Garrod, Bryn – PersonEntity: Name: NameFull: Kubicki, Grzegorz – PersonEntity: Name: NameFull: Morayne, Michal IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Text: 2012 Type: published Y: 2012 Identifiers: – Type: issn-print Value: 08954801 Numbering: – Type: volume Value: 26 – Type: issue Value: 1 Titles: – TitleFull: SIAM Journal on Discrete Mathematics Type: main |
| ResultId | 1 |
