Building a Good Team: Secretary Problems and the Supermodular Degree

DOI10.1137/1.9781611974782.109zbMath1422.68338arXiv1507.06199OpenAlexW935564312MaRDI QIDQ4575852

Rani Izsak, Moran Feldman

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.06199

zbMATH Keywords

secretary problemsupermodular degree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Unnamed Item ⋮ A Simple and Approximately Optimal Mechanism for a Buyer with Complements

This page was built for publication: Building a Good Team: Secretary Problems and the Supermodular Degree