Online k-max Search Algorithms with Applications to the Secretary Problem

DOI10.1007/978-3-319-41168-2_18MaRDI QIDQ2830073zbMATH OpenOpenAlexFDO

Authors Sizhe Wang, Yinfeng Xu

Publication date 9 November 2016

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-41168-2_18

zbMATH Keywords

\(k\)-max searchcompetitive analysisonline algorithmsecretary problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online algorithms for the general k-search problem
• Optimal online \(k\)-min search
• Online (J, K)-search problem and its competitive analysis
• Online maximum \(k\)-coverage
• Online maximum \(k\)-coverage
• Online algorithms for the maximum \(k\)-interval coverage problem
• Online two stage k-search problem and its competitive analysis
• A note on the online interval scheduling secretary problem
• Matroids, secretary problems, and online mechanisms
• Online algorithms for the maximum \(k\)-colorable subgraph problem

Cites work

• A multiple-choice secretary algorithm with applications to online auctions
• Average-case competitive analyses for one-way trading
• Competitive algorithms for unbounded one-way trading
• scientific article; zbMATH DE number 1256669 (Why is no real title available?)
• Matroids, secretary problems, and online mechanisms
• Online search with time-varying price bounds
• Online stochastic packing applied to display ad allocation
• Optimal algorithms for \(k\)-search with application in option pricing
• Optimal algorithms for online time series search and one-way trading with interrelated prices
• Optimal algorithms for the online time series search problem
• Optimal buy-and-hold strategies for financial markets with bounded daily returns
• Optimal online \(k\)-min search
• Optimal search and one-way trading online algorithms

Cited in

(5)

• Optimal online \(k\)-min search
• New results for the \(k\)-secretary problem
• A note on the online interval scheduling secretary problem
• A multiple-choice secretary algorithm with applications to online auctions
• Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order

This page was built for publication: Online k-max Search Algorithms with Applications to the Secretary Problem

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