On a universal best choice algorithm for partially ordered sets (Q3503603)
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: On a universal best choice algorithm for partially ordered sets |
scientific article; zbMATH DE number 5285048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a universal best choice algorithm for partially ordered sets |
scientific article; zbMATH DE number 5285048 |
Statements
On a universal best choice algorithm for partially ordered sets (English)
0 references
5 June 2008
0 references
partial order
0 references
secretary problem
0 references
best choice
0 references
0.8466994762420654
0 references
0.8437973260879517
0 references
0.801656186580658
0 references
0.7866169214248657
0 references
0.7863273620605469
0 references
