Skip to main content

The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis

  • Chapter
Conjoint Measurement
  • 2449 Accesses

Abstract

In abstract terms conjoint analysis can be seen as fitting a model to preference information elicited from a group of respondents. That is, conjoint analysis comprises two tasks,

  1. (1)

    preference data elicitation, and

  2. (2)

    model fitting to the elicited data.

    The model fitting phase is necessary since in general the elicited data tends to be very sparse and can be interpreted meaningfully only in the context of some model, which already encodes general assumptions on the structure of the preferences.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 139.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Toubia, J. R. Hauser, and D. I. Simester, Polyhedral Methods for Adaptive Choicebased Conjoint Analysis, Journal of Marketing Research, 41(1):116–131, 2004.

    Article  Google Scholar 

  2. R. L. Keeney and H. Raiffa. Decisions with Multiple Objectives: Preferences and Value Trade-Offs, Cambridge University Press, Cambridge, 1993.

    Google Scholar 

  3. J. MatouŠek. Lectures on Discrete Geometry, volume 212 of Graduate Texts in Mathematics, Springer Verlag, New York, 2002.

    Google Scholar 

  4. M. L. Fredman. How Good is the Information Theory Bound in Sorting, Theoretical Computer Science, 1:355–361, 1976.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Giesen, J., Schuberth, E. (2007). The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis. In: Gustafsson, A., Herrmann, A., Huber, F. (eds) Conjoint Measurement. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71404-0_13

Download citation

Publish with us

Policies and ethics