This article proposes a model that nests both a strict tree model and the Luce choice model. The multiplicative formulation allows for easy estimation using least-squares procedures. The model is shown to be more parsimonious than the hierarchical elimination method and in a small illustration, to significantly out-perform Luce in predicting soft-drink preferences.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Combined Simply Scalable and Tree-Based Preference Model

  • Donald R. Lehmann,
  • William L. Moore

摘要

This article proposes a model that nests both a strict tree model and the Luce choice model. The multiplicative formulation allows for easy estimation using least-squares procedures. The model is shown to be more parsimonious than the hierarchical elimination method and in a small illustration, to significantly out-perform Luce in predicting soft-drink preferences.