Lookahead and Hybrid Sample Allocation Procedures for Multiple Attribute Selection Decisions
July 31, 2020 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Jeffrey W. Herrmann, Kunal Mehta
arXiv ID
2007.16119
Category
econ.TH
Cross-listed
cs.AI
Citations
1
Venue
arXiv.org
Last Checked
3 months ago
Abstract
Attributes provide critical information about the alternatives that a decision-maker is considering. When their magnitudes are uncertain, the decision-maker may be unsure about which alternative is truly the best, so measuring the attributes may help the decision-maker make a better decision. This paper considers settings in which each measurement yields one sample of one attribute for one alternative. When given a fixed number of samples to collect, the decision-maker must determine which samples to obtain, make the measurements, update prior beliefs about the attribute magnitudes, and then select an alternative. This paper presents the sample allocation problem for multiple attribute selection decisions and proposes two sequential, lookahead procedures for the case in which discrete distributions are used to model the uncertain attribute magnitudes. The two procedures are similar but reflect different quality measures (and loss functions), which motivate different decision rules: (1) select the alternative with the greatest expected utility and (2) select the alternative that is most likely to be the truly best alternative. We conducted a simulation study to evaluate the performance of the sequential procedures and hybrid procedures that first allocate some samples using a uniform allocation procedure and then use the sequential, lookahead procedure. The results indicate that the hybrid procedures are effective; allocating many (but not all) of the initial samples with the uniform allocation procedure not only reduces overall computational effort but also selects alternatives that have lower average opportunity cost and are more often truly best.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β econ.TH
π
π
The Cartographer
R.I.P.
π»
Ghosted
Measuring the Completeness of Theories
R.I.P.
π»
Ghosted
Interactive coin offerings
R.I.P.
π»
Ghosted
Allocating marketing resources over social networks: A long-term analysis
R.I.P.
π»
Ghosted
Approximately Optimal Mechanism Design
R.I.P.
π»
Ghosted
A Social Network Analysis of Occupational Segregation
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Neural Architecture Search with Reinforcement Learning
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted