Quick and easy choice sets: Constructing optimal and nearly optimal stated choice experiments

In this paper we compare a number of common strategies for constructing discrete choice experiments. Two of the strategies, including one based on theoretical constructions for optimal discrete choice experiments, produce designs that are better than those that come about from random grouping and from using the L-MA construction. A simple account of this theoretical construction is given. (c) 2005 Elsevier B.V. All rights reserved.