Online algorithms for the multiple time series search problem (Q1762061): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2011.07.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2076181989
@@ Property / OpenAlex ID: W2076181989 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal search and one-way trading online algorithms
+Normal rank
@@ Property / cites work @@
+Online search with time-varying price bounds
@@ Property / cites work: Online search with time-varying price bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for \(k\)-search with application in option pricing
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for the online time series search problem
+Normal rank
@@ Property / cites work @@
+Q3378055
@@ Property / cites work: Q3378055 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal stopping problems by two or more decision makers: a survey
+Normal rank
@@ Property / cites work @@
+Optimal selection based on relative rank (the 'Secretary Problem')
+Normal rank
@@ Property / cites work @@
+Optimal stopping with sampling cost: The secretary problem
+Normal rank
@@ Property / cites work @@
+Secretary problems with inspection costs as a game
+Normal rank
@@ Property / cites work @@
+Q4633940
@@ Property / cites work: Q4633940 / rank @@
+Normal rank
@@ Property / cites work @@
+Who solved the secretary problem
@@ Property / cites work: Who solved the secretary problem / rank @@
+Normal rank
@@ Property / cites work @@
+Average-case competitive analyses for one-way trading
+Normal rank