Secretary Problems with Convex Costs

DOI10.1007/978-3-642-31594-7_7zbMath1272.91067arXiv1112.1136OpenAlexW1771298372MaRDI QIDQ2843237

Shuchi Chawla, Siddharth Barman, David Malec, Seeun William Umboh

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

zbMATH Keywords

online resource allocation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)

Related Items (5)

A Framework for the Secretary Problem on the Intersection of Matroids ⋮ Unnamed Item ⋮ The Submodular Secretary Problem Goes Linear ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem

This page was built for publication: Secretary Problems with Convex Costs