An optimal algorithm for stopping on the element closest to the center of an interval (Q2665754): Difference between revisions

@@ Property / arXiv ID @@
+.12600
@@ Property / arXiv ID: 1904.12600 / rank @@
+Normal rank
@@ Property / cites work @@
+Percolation and best-choice problem for powers of paths
+Normal rank
@@ Property / cites work @@
+Who solved the secretary problem
@@ Property / cites work: Who solved the secretary problem / rank @@
+Normal rank
@@ Property / cites work @@
+Partially ordered secretaries
@@ Property / cites work: Partially ordered secretaries / rank @@
+Normal rank
@@ Property / cites work @@
+On a universal best choice algorithm for partially ordered sets
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for stopping on a sink in a directed graph
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Decision Theory
@@ Property / cites work: Dynamic Programming and Decision Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Partial-order analogue of the secretary problem: The binary tree case
+Normal rank
@@ Property / cites work @@
+The best-choice problem for partially ordered objects.
+Normal rank
@@ Property / cites work @@
+Probabilities of choosing applicants of arbitrary rank in the secretary problem
+Normal rank
@@ Property / cites work @@
+A Problem of Optimal Choice and Assignment
@@ Property / cites work: A Problem of Optimal Choice and Assignment / rank @@
+Normal rank
@@ Property / cites work @@
+Q3921912
@@ Property / cites work: Q3921912 / rank @@
+Normal rank
@@ Property / cites work @@
+The best choice problem for upward directed graphs
+Normal rank