publication . Preprint . 2016

Pairwise Choice Markov Chains

Ragain, Stephen; Ugander, Johan;
Open Access English
  • Published: 08 Mar 2016
As datasets capturing human choices grow in richness and scale -- particularly in online domains -- there is an increasing need for choice models that escape traditional choice-theoretic axioms such as regularity, stochastic transitivity, and Luce's choice axiom. In this work we introduce the Pairwise Choice Markov Chain (PCMC) model of discrete choice, an inferentially tractable model that does not assume any of the above axioms while still satisfying the foundational axiom of uniform expansion, a considerably weaker assumption than Luce's choice axiom. We show that the PCMC model significantly outperforms the Multinomial Logit (MNL) model in prediction tasks o...
free text keywords: Statistics - Machine Learning, Computer Science - Artificial Intelligence
Download from
31 references, page 1 of 3

[1] Ernest Adams and Samuel Messick. An axiomatic formulation and generalization of successive intervals scaling. Psychometrika, 23(4):355-368, 1958.

[2] Austin R. Benson, Ravi Kumar, and Andrew Tomkins. On the relevance of irrelevant alternatives. In Proceedings of WWW, 2016.

[3] Jose Blanchet, Guillermo Gallego, and Vineet Goyal. A markov chain approximation to choice modeling. In Proceedings of EC, pages 103-104, 2013.

[4] Henry David Block, Jacob Marschak, et al. Random orderings and stochastic theories of responses. Contributions to Probability and Statistics, 2:97-132, 1960.

[5] Axel Bo¨ rsch-Supan. On the compatibility of nested logit models with utility maximization. Journal of Econometrics, 43(3):373-388, 1990.

[6] George EP Box. Science and statistics. Journal of the American Statistical Association, 71(356):791-799, 1976. [OpenAIRE]

[7] J Hayden Boyd and Robert E Mellman. The effect of fuel economy standards on the us automotive market: an hedonic demand analysis. Transportation Research Part A: General, 14(5-6):367-378, 1980.

[8] Ralph Allan Bradley and Milton E Terry. Rank analysis of incomplete block designs the method of paired comparisons. Biometrika, 39(3-4):324-345, 1952. [OpenAIRE]

[9] Shou Chen and Thorsten Joachims. Modeling intransitivity in matchup and comparison data. In Proceedings of WSDM, 2016.

[10] Gerard Debreu. Review of individual choice behavior: A theoretical analysis. The American Economic Review, 1960.

[11] Jean-Claude Falmagne. A representation theorem for finite random scale systems. Journal of Mathematical Psychology, 18(1):52-72, 1978.

[12] Paul E Green, Abba M Krieger, and Yoram Wind. Thirty years of conjoint analysis: Reflections and prospects. Interfaces, 31(3 supplement):S56-S73, 2001.

[13] Joel Huber, John W Payne, and Christopher Puto. Adding asymmetrically dominated alternatives: Violations of regularity and the similarity hypothesis. Journal of Consumer Research, pages 90-98, 1982.

[14] Samuel Ieong, Nina Mishra, and Or Sheffet. Predicting preference flips in commerce search. In ICML, 2012. [OpenAIRE]

[15] Jon Kleinberg and Maithra Raghu. Team performance with test scores. In Proceedings of EC, pages 511-528, 2015. [OpenAIRE]

31 references, page 1 of 3
Any information missing or wrong?Report an Issue