The solution of a generalized secretary problem via analytic expressions (Q2012898): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved Algorithms and Analysis for Secretary Problems and Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to a class of best choice problems with an unknown number of options / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secretary Problems via Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online <i>K</i>-Item Auction and Bipartite <i>K</i>-Matching with Random Arrival Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3237805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an optimal stopping problem of Gusein-Zade / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Secretary Problem and Its Extensions: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact results for a secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol / rank
 
Normal rank

Latest revision as of 04:49, 14 July 2024

scientific article
Language Label Description Also known as
English
The solution of a generalized secretary problem via analytic expressions
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references