The secretary problem on an unknown poset (Q2868083): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4002436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who solved the secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially ordered secretaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Choose the Best Twins / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a universal best choice algorithm for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriterial problem of optimum stopping of the selection process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-order analogue of the secretary problem: The binary tree case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best-choice problem for partially ordered objects. / rank
 
Normal rank

Latest revision as of 05:09, 7 July 2024

scientific article
Language Label Description Also known as
English
The secretary problem on an unknown poset
scientific article

    Statements

    Identifiers