𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The usefulness of Bayesian optimal designs for discrete choice experiments

✍ Scribed by Roselinde Kessels; Bradley Jones; Peter Goos; Martina Vandebroek


Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
767 KB
Volume
27
Category
Article
ISSN
1524-1904

No coin nor oath required. For personal study only.

✦ Synopsis


Recently, the use of Bayesian optimal designs for discrete choice experiments, also called stated choice experiments or conjoint choice experiments, has gained much attention, stimulating the development of Bayesian choice design algorithms. Characteristic for the Bayesian design strategy is that it incorporates the available information about people's preferences for various product attributes in the choice design. This is in contrast with the linear design methodology, which is also used in discrete choice design and which depends for any claims of optimality on the unrealistic assumption that people have no preference for any of the attribute levels. Although linear design principles have often been used to construct discrete choice experiments, we show using an extensive case study that the resulting utility-neutral optimal designs are not competitive with Bayesian optimal designs for estimation purposes.


πŸ“œ SIMILAR VOLUMES


Genetic algorithm for discrete-sizing op
✍ A. Kaveh; V. Kalatjari πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 138 KB

## Abstract In the process of discrete‐sizing optimal design of truss structures by Genetic Algorithm (GA), analysis should be performed several times. In this article, the force method is employed for the analysis. The advantage of using this method lies in the fact that the matrices corresponding

A regional genetic algorithm for the dis
✍ A. A. Groenwold; N. Stander; J. A. Snyman πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 2 views

A regional genetic algorithm (R-GA) is used for the discrete optimal design of truss structures. The chromosomes are selected from a sub-region centred on the continuous optimum. This approach replaces genetic rebirth as previously proposed by other authors, thereby signiΓΏcantly reducing computation