A Weakest Link Marked Stopping Problem

DOI10.1239/JAP/1197908808MaRDI QIDQ5448736zbMATH OpenOpenAlexFDO

Authors Steven A. Lippman, Sheldon M. Ross, Sridhar Seshadri

Publication date 7 March 2008

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.jap/1197908808

zbMATH Keywords

marked stopping problemonline heuristicstructure of optimal policyweakest link

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• Multiple buying or selling with vector offers
• scientific article; zbMATH DE number 4046795
• The house-selling problem with reward rate criterion
• Bayesian selling problem with partial information
• scientific article; zbMATH DE number 4160511

Cited in

(3)

• scientific article; zbMATH DE number 4160511 (Why is no real title available?)
• On optimal bidding in sequential procurement auctions
• On optimal bidding and inventory control in sequential procurement auctions: the multi period case

This page was built for publication: A Weakest Link Marked Stopping Problem

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