Name
Abstract | ||
|---|---|---|
We examine a sequential selection problem in which a single option must be selected. Each option's value is a function of its attributes, whose precise values can be ascertained at a given cost. We prove the optimality of a threshold stopping rule for a general class of objective functions. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.orl.2006.04.002 | Oper. Res. Lett. |
Keywords | Field | DocType |
sequential search,general value function,multi-attribute optimization,single option,sequential selection problem,objective function,dynamic programming,general class,precise value,value function | Dynamic programming,Sequential selection,Mathematical optimization,Optimal stopping,Algorithm,Sequential method,Bellman equation,Linear search,Stopping rule,Mathematics | Journal |
Volume | Issue | ISSN |
35 | 3 | Operations Research Letters |
Citations | PageRank | References |
1 | 0.37 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Cole Smith | 1 | 610 | 43.34 |
| Churlzu Lim | 2 | 83 | 6.63 |
| J. Neil Bearden | 3 | 58 | 7.01 |