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

DOI10.1007/978-3-319-41168-2_18zbMath1478.68454OpenAlexW2506852839MaRDI QIDQ2830073

Sizhe Wang, Yin-Feng 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

competitive analysisonline algorithmsecretary problem\(k\)-max search

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal algorithms for online time series search and one-way trading with interrelated prices
• Optimal algorithms for the online time series search problem
• Average-case competitive analyses for one-way trading
• Optimal algorithms for \(k\)-search with application in option pricing
• Online search with time-varying price bounds
• On variants of the matroid secretary problem
• Optimal online \(k\)-min search
• Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns
• Online Stochastic Packing Applied to Display Ad Allocation
• Competitive Algorithms for Unbounded One-Way Trading
• Optimal search and one-way trading online algorithms

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