Partial-order analogue of the secretary problem: The binary tree case (Q1584204)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partial-order analogue of the secretary problem: The binary tree case |
scientific article; zbMATH DE number 1524809
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partial-order analogue of the secretary problem: The binary tree case |
scientific article; zbMATH DE number 1524809 |
Statements
Partial-order analogue of the secretary problem: The binary tree case (English)
0 references
2 November 2000
0 references
secretary problem
0 references
optimal stopping
0 references
binary tree
0 references
0.87497056
0 references
0.85378605
0 references
0.8507714
0 references
0.85007423
0 references
0.8481344
0 references
0.84125245
0 references
