A Framework for the Secretary Problem on the Intersection of Matroids
From MaRDI portal
(Redirected from Publication:5087013)
Recommendations
- A framework for the secretary problem on the intersection of matroids
- Secretary problem: graphs, matroids and greedoids
- Matroid secretary problem in the random-assignment model
- Matroid secretary problem in the random assignment model
- Matroids, secretary problems, and online mechanisms
- The matroid secretary problem for minor-closed classes and random matroids
- Secretary problems: laminar matroid and interval scheduling
- Advances on matroid secretary problems: free order model and laminar case
Cites work
- A Knapsack Secretary Problem with Applications
- A multiple-choice secretary algorithm with applications to online auctions
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Advances on matroid secretary problems: free order model and laminar case
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- An Analysis of the Greedy Heuristic for Independence Systems
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Competitive weighted matching in transversal matroids
- Dynamic Programming and Decision Theory
- Fast algorithms for maximizing submodular functions
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3544074 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 3383344 (Why is no real title available?)
- Improved competitive ratio for the matroid secretary problem
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Matroid prophet inequalities
- Matroid secretary problem in the random-assignment model
- Matroid Secretary Problems
- Matroids, secretary problems, and online mechanisms
- Multi-parameter mechanism design and sequential posted pricing
- Online contention resolution schemes with applications to Bayesian selection problems
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- Polymatroid Prophet Inequalities
- Prophet Inequalities with Limited Information
- Secretary problems with convex costs
- Secretary Problems with Non-Uniform Arrival Order
- Secretary problems: laminar matroid and interval scheduling
- Strong algorithms for the ordinal matroid secretary problem
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Submodular secretary problem and extensions
- The matroids with the max-flow min-cut property
- The simulated greedy algorithm for several submodular matroid secretary problems
- The submodular secretary problem goes linear
- Who solved the secretary problem
Cited in
(4)
This page was built for publication: A Framework for the Secretary Problem on the Intersection of Matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087013)
