Algorithms for Secretary Problems on Graphs and Hypergraphs
From MaRDI portal
Recommendations
Cited in
(52)- Near optimal algorithms for online weighted bipartite matching in adversary model
- Matroid prophet inequalities and applications to multi-dimensional mechanism design
- Stable secretaries
- Online stochastic matching: new algorithms and bounds
- Secretary markets with local information
- Learn from history for online bipartite matching
- Online generalized assignment problem with historical information
- Online crowdsourced truck delivery using historical information
- Formal barriers to simple algorithms for the matroid secretary problem
- Prior independent mechanisms via prophet inequalities with limited information
- Competitive weighted matching in transversal matroids
- A note on the online interval scheduling secretary problem
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- The simulated greedy algorithm for several submodular matroid secretary problems
- The returning secretary
- Buyback problem -- approximate matroid intersection with cancellation costs
- Improved competitive ratios for submodular secretary problems (extended abstract)
- Online network design with outliers
- Secretary markets with local information
- The Temp Secretary Problem
- Primal beats dual on online packing LPs in the random-order model
- The submodular secretary problem goes linear
- Online purchasing under uncertainty
- Strong algorithms for the ordinal matroid secretary problem
- Submodular secretary problems: cardinality, matching, and linear constraints
- A Framework for the Secretary Problem on the Intersection of Matroids
- Packing returning secretaries
- Technical note -- Online hypergraph matching with delays
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- The matroid secretary problem for minor-closed classes and random matroids
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Improved competitive ratio for the matroid secretary problem
- scientific article; zbMATH DE number 7650251 (Why is no real title available?)
- Robust Algorithms for the Secretary Problem
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid
- Packing returning secretaries
- Secretary and online matching problems with machine learned advice
- Truthful Matching with Online Items and Offline Agents
- Algorithms for maximum social welfare of online random trading
- Prophet secretary for combinatorial auctions and matroids
- Generalized assignment and knapsack problems in the random-order model
- Matroid secretary via labeling schemes
- Online matching on 3-uniform hypergraphs
- Single sample prophet inequality for uniform matroids of rank 2
- Almost tight bounds for online hypergraph matching
- Analytic insights into an adapted algorithm for the score-based secretary problem
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid
- Online combinatorial assignment in independence systems
- Online combinatorial assignment in independence systems
- Beating competitive ratio 4 for graphic matroid secretary
- Engineering hypergraph b-matching algorithms
- Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching
This page was built for publication: Algorithms for Secretary Problems on Graphs and Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321681)
