Optimal discounts for the online assignment problem

DOI10.1016/J.ORL.2012.10.004MaRDI QIDQ2376746zbMATH OpenOpenAlexFDO

Authors Michael Z. Spivey

Publication date 24 June 2013

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2012.10.004

zbMATH Keywords

linear programmingassignment problemonline matchingonline assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Secretary problems: weights and discounts
• Approximation and Online Algorithms
• Optimal Online Algorithms for Minimax Resource Scheduling
• Markovian assignment decision process
• Asymptotics of the optimum in discrete sequential assignment

Cited in

(1)

• An on-line assignment problem with random effectiveness and costly information

This page was built for publication: Optimal discounts for the online assignment problem

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