Recommendations
Cites work
- scientific article; zbMATH DE number 7051296 (Why is no real title available?)
- scientific article; zbMATH DE number 3383344 (Why is no real title available?)
- 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 optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Combinatorial secretary problems with ordinal information
- Competitive weighted matching in transversal matroids
- Dueling algorithms
- Dynamic Programming and Decision Theory
- Effects of competition in a secretary problem
- Matroid prophet inequalities
- Matroid secretary problem in the random-assignment model
- Matroids, secretary problems, and online mechanisms
- Near optimal online algorithms and fast approximation algorithms for resource allocation problems
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- Polymatroid Prophet Inequalities
- Primal beats dual on online packing LPs in the random-order model
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- Secretary Problems via Linear Programming
- Secretary markets with local information
- Secretary problems: laminar matroid and interval scheduling
- Semiamarts and finite values
- Stable secretaries
- Submodular secretary problem and extensions
- The submodular secretary problem goes linear
- Who solved the secretary problem
Cited in
(5)
This page was built for publication: Secretary markets with local information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010597)
