Secretary markets with local information
From MaRDI portal
Publication:3449504
Recommendations
Cites work
- 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
- AdWords and generalized online matching
- 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
- Competitive weighted matching in transversal matroids
- Dueling algorithms
- Dynamic Programming and Decision Theory
- Matroid Secretary Problems
- 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 bipartite matching with unknown distributions
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- Primal beats dual on online packing LPs in the random-order model
- Secretary problems: laminar matroid and interval scheduling
Cited in
(3)
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 Q3449504)