Secretary and online matching problems with machine learned advice
Authors:
- Antonios AntoniadisAntonios Antoniadis
- Themis GouleakisTGThemis Gouleakis
- Pieter KleerPieter Kleer
- Pavel KolevPKPavel Kolev
Top Cited Papers
Open Access
- 10 June 2023
- journal article
- research article
- Published by Elsevier in Discrete Optimization
- Vol. 48
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (AN 1262/1-1)
This publication has 31 references indexed in Scilit:
- Matroid prophet inequalities and applications to multi-dimensional mechanism designGames and Economic Behavior, 2019
- Prophet Inequalities with Limited Information2013
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions2013
- Online Optimization with Uncertain InformationACM Transactions on Algorithms, 2012
- Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations2011
- Competitive Weighted Matching in Transversal MatroidsAlgorithmica, 2010
- Secretary Problems: Weights and Discounts2009
- Algorithms for Secretary Problems on Graphs and Hypergraphs2009
- Competitive k-server algorithmsJournal of Computer and System Sciences, 1994
- Mathematical GamesScientific American, 1960