Secretary markets with local information
From MaRDI portal
Publication:2010597
DOI10.1007/s00446-018-0327-5zbMath1447.91083OpenAlexW2793085254MaRDI QIDQ2010597
Peihan Miao, Marvin Künnemann, Ning Chen, Martin Hoefer, Cheng-yu Lin
Publication date: 27 November 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-018-0327-5
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Who solved the secretary problem
- Stable secretaries
- 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
- Submodular secretary problem and extensions
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs
- Secretary Markets with Local Information
- Polymatroid Prophet Inequalities
- Secretary Problems via Linear Programming
- Semiamarts and finite values
- Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
- The Submodular Secretary Problem Goes Linear
- Advances on Matroid Secretary Problems: Free Order Model and Laminar Case
- Effects of Competition in a Secretary Problem
- 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
- Matroid prophet inequalities
- Dueling algorithms
- Dynamic Programming and Decision Theory
