quot;Greedoid languagesquot; provide a basis to infer best-fitting noncompensatory decision rules from full-rank conjoint data or partial-rank data such as consider-then-rank, consider-only, or choice data. Potential decision rules include elimination-by-aspects, acceptance-by-aspects,...

We propose and test new "polyhedral" question design and estimation methods that use recent developments in mathematical programming. The methods are designed to offer accurate estimates after relatively few questions in problems involving many parameters. With polyhedral question design, each...

Greedoid languages provide a basis to infer best-fitting noncompensatory decision rules from full-rank conjoint data or partial-rank data such as consider-then-rank, consider-only, or choice data. Potential decision rules include elimination by aspects, acceptance by aspects, lexicographic by...

We propose and test new adaptive question design and estimation algorithms for partial profile conjoint analysis. Polyhedral question design focuses questions to reduce a feasible set of parameters as rapidly as possible. Analytic center estimation uses a centrality criterion based on...

Market prices are well known to efficiently collect and aggregate diverse information regarding the value of commodities and assets. The role of markets has been particularly suitable to pricing financial securities. This article provides an alternative application of the pricing mechanism to...