The secretary problem with reservation costs
From MaRDI portal
Publication:2695326
DOI10.1007/978-3-030-89543-3_46OpenAlexW3210156514MaRDI QIDQ2695326
Matthias Gehnen, Henri Lotze, Peter Rossmanith, Elisabet Burjons, Daniel Mock
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_46
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online algorithms with advice: the tape model
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles
- The string guessing problem as a method to prove lower bounds on the advice complexity
- Exploring sparse graphs with advice (extended abstract)
- On the advice complexity of the online dominating set problem
- The online knapsack problem: advice and randomization
- On the Advice Complexity of the k-Server Problem
- On the Power of Randomness versus Advice in Online Computation
- On Energy-Efficient Computations With Advice
- A Knapsack Secretary Problem with Applications
- Secretary Problems via Linear Programming
- Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order
- Prediction, Learning, and Games
- Dynamic Programming and Decision Theory
- Online Minimum Spanning Tree with Advice
This page was built for publication: The secretary problem with reservation costs
