A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/moor.2017.0876 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2782298540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prophet Inequalities with Limited Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secretary Problems with Convex Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular secretary problem and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive weighted matching in transversal matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Secretary for Regular and Decomposable Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Who solved the secretary problem? With comments and a rejoinder by the author / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on Matroid Secretary Problems: Free Order Model and Laminar Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Secretary Problems on Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simulated greedy algorithm for several submodular matroid secretary problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variants of the matroid secretary problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Secretary Problem in the Random-Assignment Model / rank
 
Normal rank

Latest revision as of 01:43, 22 July 2024

scientific article; zbMATH DE number 7179757
Language Label Description Also known as
English
A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
scientific article; zbMATH DE number 7179757

    Statements

    A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (English)
    0 references
    0 references
    0 references
    0 references
    12 March 2020
    0 references
    matroids
    0 references
    online algorithms
    0 references
    secretary problem
    0 references

    Identifiers

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