Secretary Markets with Local Information
From MaRDI portal
Publication:3449504
DOI10.1007/978-3-662-47666-6_44zbMath1447.91082OpenAlexW1919540593MaRDI QIDQ3449504
Peihan Miao, Martin Hoefer, Ning Chen, Marvin Künnemann, Cheng-yu Lin
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_44
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive weighted matching in transversal matroids
- Matroid Secretary Problem in the Random-Assignment Model
- Geometry of Online Packing Linear Programs
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- AdWords and generalized online matching
- Matroid Secretary Problems
- Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
- Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
- Matroid Secretary for Regular and Decomposable Matroids
- Primal beats dual on online packing LPs in the random-order model
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
- Dueling algorithms
- Online bipartite matching with unknown distributions
- Dynamic Programming and Decision Theory