Secretary problems: weights and discounts

MaRDI QIDQ4633940zbMATH OpenFDO

Authors Moshe Babaioff, Michael Dinitz, Anupam Gupta, Nicole Immorlica, Kunal Talwar

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496905

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Probabilistic games; gambling (91A60) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Matroids, secretary problems, and online mechanisms
• Matroid Secretary Problems
• Submodular secretary problem and extensions
• Submodular secretary problem and extensions
• Secretary problems: laminar matroid and interval scheduling

Cited in

(14)

• Online algorithms for the multiple time series search problem
• Secretary markets with local information
• Optimal discounts for the online assignment problem
• The simulated greedy algorithm for several submodular matroid secretary problems
• The submodular secretary problem goes linear
• Worst-case mechanism design via Bayesian analysis
• Strong algorithms for the ordinal matroid secretary problem
• Generalized sequential stochastic assignment problem
• Secretary and online matching problems with machine learned advice
• Optimal algorithms for the online time series search problem
• Matroid secretary via labeling schemes
• Robust algorithms for online k-means clustering
• Pairwise-independent contention resolution
• Pairwise-independent contention resolution

This page was built for publication: Secretary problems: weights and discounts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633940)