Secretary and online matching problems with machine learned advice
From MaRDI portal
Publication:6108930
DOI10.1016/j.disopt.2023.100778arXiv2006.01026OpenAlexW3031442975MaRDI QIDQ6108930
Antonios Foivos Antoniadis, Pieter Kleer, Pavel Kolev, Themis Gouleakis
Publication date: 30 June 2023
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.01026
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive \(k\)-server algorithms
- Matroid prophet inequalities and applications to multi-dimensional mechanism design
- Competitive weighted matching in transversal matroids
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
- Secretary Problems with Non-Uniform Arrival Order
- Online Optimization with Uncertain Information
- Matroid Secretary Problems
- Online Vertex-Weighted Bipartite Matching
- Competitive Caching with Machine Learned Advice
- Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution
- Near-Optimal Bounds for Online Caching with Machine Learned Advice
- Online Scheduling via Learned Weights
- The Two-Sided Game of Googol and Sample-Based Prophet Inequalities
- Competitive Analysis with a Sample and the Secretary Problem
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
- Prophet Inequalities with Limited Information
- Online bipartite matching with random arrivals
- Dynamic Programming and Decision Theory
- Scheduling with Predictions and the Price of Misprediction
- Robust Algorithms for the Secretary Problem
