{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/pairwise-choice-markov-chains","title":"Pairwise Choice Markov Chains","arxiv_id":"1603.02740","date":"2016-03-08","proceeding":"NeurIPS 2016 12","authors":["Stephen Ragain","Johan Ugander"],"abstract":"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 on both synthetic and empirical datasets known to exhibit violations of Luce's axiom. Our analysis also synthesizes several recent observations connecting the Multinomial Logit model and Markov chains; the PCMC model retains the Multinomial Logit model as a special case.","url_abs":"https://arxiv.org/abs/1603.02740v4","url_pdf":"https://arxiv.org/pdf/1603.02740v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"pairwise-choice-markov-chains","repo_url":"https://github.com/sragain/pcmc-nips","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1603.02740","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.02740"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sragain/pcmc-nips","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"66e2fe9a9bbc43e0","entry":"comp_error","repo":"sragain/pcmc-nips","repo_kind":"official","path":"lib/mmnl_utils.py","file_url":"https://github.com/sragain/pcmc-nips/blob/HEAD/lib/mmnl_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"66e2fe9a9bbc43e0"}},{"code_sha256_prefix":"ef50a8e0e0caefb7","entry":"comp_error","repo":"sragain/pcmc-nips","repo_kind":"official","path":"lib/mnl_utils.py","file_url":"https://github.com/sragain/pcmc-nips/blob/HEAD/lib/mnl_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ef50a8e0e0caefb7"}},{"code_sha256_prefix":"665eaf044f5d8606","entry":"compute_probs","repo":"sragain/pcmc-nips","repo_kind":"official","path":"lib/mmnl_utils.py","file_url":"https://github.com/sragain/pcmc-nips/blob/HEAD/lib/mmnl_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"665eaf044f5d8606"}},{"code_sha256_prefix":"11d7548673b867e3","entry":"neg_L","repo":"sragain/pcmc-nips","repo_kind":"official","path":"lib/mmnl_utils.py","file_url":"https://github.com/sragain/pcmc-nips/blob/HEAD/lib/mmnl_utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"11d7548673b867e3"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}