The best-choice problem for partially ordered objects

The best-choice problem for partially ordered objects

0.00 Avg rating0 Votes
Article ID: iaor20052323
Country: Netherlands
Volume: 25
Issue: 4
Start Page Number: 187
End Page Number: 190
Publication Date: Nov 1999
Journal: Operations Research Letters
Authors:
Keywords: statistics: decision
Abstract:

We consider the problem of making a single on-line selection from a random sequence of partially ordered objects. We show that, as long as the number of objects is given in advance, the selector can pick a maximal one with probability at least 1/8, without prior knowledge of the partial order.

Reviews

Required fields are marked *. Your email address will not be published.