{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/discrete-choice-models","name":"Discrete Choice Models","slug":"discrete-choice-models","description_markdown":null,"categories":[{"name":"Reasoning","url":"/area/reasoning"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":104,"papers_with_code":16,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":2,"rows_per_page":100,"shown":100,"of":104,"of_with_code":16,"tagged_in_all":104,"counts":{"archive_papers_tagged":104,"with_a_code_link":16,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":104,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/representing-random-utility-choice-models","slug":"representing-random-utility-choice-models","title":"Representing Random Utility Choice Models with Neural Networks","date":"2022-07-26","arxiv_id":"2207.12877","repositories_listed":2,"syntology":null},{"url":"/paper/a-neural-embedded-choice-model-tastenet-mnl","slug":"a-neural-embedded-choice-model-tastenet-mnl","title":"A Neural-embedded Choice Model: TasteNet-MNL Modeling Taste Heterogeneity with Flexibility and Interpretability","date":"2020-02-03","arxiv_id":"2002.00922","repositories_listed":2,"syntology":null},{"url":"/paper/let-me-not-lie-learning-multinomial-logit","slug":"let-me-not-lie-learning-multinomial-logit","title":"Enhancing Discrete Choice Models with Representation Learning","date":"2018-12-23","arxiv_id":"1812.09747","repositories_listed":2,"syntology":null},{"url":"/paper/choice-learn-large-scale-choice-modeling-for","slug":"choice-learn-large-scale-choice-modeling-for","title":"Choice-Learn: Large-scale choice modeling for operational contexts through the lens of machine learning","date":"2024-09-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/the-heterogeneous-aggregate-valence-analysis","slug":"the-heterogeneous-aggregate-valence-analysis","title":"The Mixed Aggregate Preference Logit Model: A Machine Learning Approach to Modeling Unobserved Heterogeneity in Discrete Choice Analysis","date":"2024-01-31","arxiv_id":"2402.00184","repositories_listed":1,"syntology":null},{"url":"/paper/a-prediction-and-behavioural-analysis-of","slug":"a-prediction-and-behavioural-analysis-of","title":"A prediction and behavioural analysis of machine learning methods for modelling travel mode choice","date":"2023-01-11","arxiv_id":"2301.04404","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-methods-for-discrete-choice","slug":"graph-based-methods-for-discrete-choice","title":"Graph-Based Methods for Discrete Choice","date":"2022-05-23","arxiv_id":"2205.11365","repositories_listed":1,"syntology":null},{"url":"/paper/fast-learning-of-mnl-model-from-general","slug":"fast-learning-of-mnl-model-from-general","title":"Fast Learning of MNL Model from General Partial Rankings with Application to Network Formation Modeling","date":"2021-12-31","arxiv_id":"2112.15575","repositories_listed":1,"syntology":null},{"url":"/paper/equality-of-opportunity-in-travel-behavior","slug":"equality-of-opportunity-in-travel-behavior","title":"Equality of opportunity in travel behavior prediction with deep neural networks and discrete choice models","date":"2021-09-25","arxiv_id":"2109.12422","repositories_listed":1,"syntology":null},{"url":"/paper/combining-discrete-choice-models-and-neural","slug":"combining-discrete-choice-models-and-neural","title":"Combining Discrete Choice Models and Neural Networks through Embeddings: Formulation, Interpretability and Performance","date":"2021-09-24","arxiv_id":"2109.12042","repositories_listed":1,"syntology":null},{"url":"/paper/identification-of-incomplete-preferences","slug":"identification-of-incomplete-preferences","title":"Identification of Incomplete Preferences","date":"2021-08-13","arxiv_id":"2108.06282","repositories_listed":1,"syntology":null},{"url":"/paper/choice-set-confounding-in-discrete-choice","slug":"choice-set-confounding-in-discrete-choice","title":"Choice Set Confounding in Discrete Choice","date":"2021-05-17","arxiv_id":"2105.07959","repositories_listed":1,"syntology":null},{"url":"/paper/semi-discrete-optimal-transport-hardness","slug":"semi-discrete-optimal-transport-hardness","title":"Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution","date":"2021-03-10","arxiv_id":"2103.06263","repositories_listed":1,"syntology":null},{"url":"/paper/robust-discrete-choice-models-with-t","slug":"robust-discrete-choice-models-with-t","title":"Robust discrete choice models with t-distributed kernel errors","date":"2020-09-14","arxiv_id":"2009.06383","repositories_listed":1,"syntology":null},{"url":"/paper/choice-set-optimization-under-discrete-choice","slug":"choice-set-optimization-under-discrete-choice","title":"Choice Set Optimization Under Discrete Choice Models of Group Decisions","date":"2020-02-02","arxiv_id":"2002.00421","repositories_listed":1,"syntology":null},{"url":"/paper/a-branch-and-cut-algorithm-for-the-latent","slug":"a-branch-and-cut-algorithm-for-the-latent","title":"A branch-and-cut algorithm for the latent-class logit assortment problem","date":"2014-02-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"a-break-from-the-norm-parametric","title":"A break from the norm? Parametric representations of preference heterogeneity for discrete choice models in health","date":"2025-06-17","arxiv_id":"2506.14099","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-deep-learning-for-discrete-choice","title":"Bayesian Deep Learning for Discrete Choice","date":"2025-05-23","arxiv_id":"2505.18077","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-feedback-control-framework-for-incentivised","title":"A Feedback Control Framework for Incentivised Suburban Parking Utilisation and Urban Core Traffic Relief","date":"2025-05-09","arxiv_id":"2505.05742","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-level-nested-and-sequential-logit","title":"Two Level Nested and Sequential Logit","date":"2025-03-25","arxiv_id":"2503.21808","repositories_listed":0,"syntology":null},{"url":null,"slug":"designing-graph-convolutional-neural-networks","title":"Designing Graph Convolutional Neural Networks for Discrete Choice with Network Effects","date":"2025-03-12","arxiv_id":"2503.09786","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-adaptive-approach-to-dynamic-discrete","title":"Model-Adaptive Approach to Dynamic Discrete Choice Models with Large State Spaces","date":"2025-01-30","arxiv_id":"2501.18746","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-inference-for-incomplete-discrete","title":"Universal Inference for Incomplete Discrete Choice Models","date":"2025-01-29","arxiv_id":"2501.17973","repositories_listed":0,"syntology":null},{"url":null,"slug":"rum-nn-a-neural-network-model-compatible-with","title":"RUM-NN: A Neural Network Model Compatible with Random Utility Maximisation for Discrete Choice Setups","date":"2025-01-09","arxiv_id":"2501.05221","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-data-driven-but-interpretable-human","title":"Fully Data-driven but Interpretable Human Behavioural Modelling with Differentiable Discrete Choice Model","date":"2024-12-27","arxiv_id":"2412.19403","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-utility-based-spatial-analysis-of","title":"A utility-based spatial analysis of residential street-level conditions; A case study of Rotterdam","date":"2024-10-23","arxiv_id":"2410.17880","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-relevance-of-item-co-exposure-for","title":"The Relevance of Item-Co-Exposure For Exposure Bias Mitigation","date":"2024-09-19","arxiv_id":"2409.12912","repositories_listed":0,"syntology":null},{"url":null,"slug":"sensitivity-analysis-for-dynamic-discrete","title":"Sensitivity Analysis for Dynamic Discrete Choice Models","date":"2024-08-29","arxiv_id":"2408.16330","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-for-the-estimation-of","title":"Deep Learning for the Estimation of Heterogeneous Parameters in Discrete Choice Models","date":"2024-08-18","arxiv_id":"2408.09560","repositories_listed":0,"syntology":null},{"url":null,"slug":"simulation-in-discrete-choice-models","title":"Simulation in discrete choice models evaluation: SDCM, a simulation tool for performance evaluation of DCMs","date":"2024-07-24","arxiv_id":"2407.17014","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-travel-choice-modeling-with-large","title":"Enhancing Travel Choice Modeling with Large Language Models: A Prompt-Learning Approach","date":"2024-06-19","arxiv_id":"2406.13558","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-choice-probability-estimation-of","title":"Conditional Choice Probability Estimation of Dynamic Discrete Choice Models with 2-period Finite Dependence","date":"2024-05-21","arxiv_id":"2405.12467","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-geometry-of-consumer-preference","title":"The geometry of consumer preference aggregation","date":"2024-05-09","arxiv_id":"2405.06108","repositories_listed":0,"syntology":null},{"url":null,"slug":"quasi-bayesian-estimation-and-inference-with","title":"Quasi-Bayesian Estimation and Inference with Control Functions","date":"2024-02-27","arxiv_id":"2402.17374","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-the-determinants-of-mode-choice","title":"Evaluating the Determinants of Mode Choice Using Statistical and Machine Learning Techniques in the Indian Megacity of Bengaluru","date":"2024-01-25","arxiv_id":"2401.13977","repositories_listed":0,"syntology":null},{"url":null,"slug":"equilibrium-multiplicity-a-systematic","title":"Equilibrium Multiplicity: A Systematic Approach using Homotopies, with an Application to Chicago","date":"2024-01-18","arxiv_id":"2401.10181","repositories_listed":0,"syntology":null},{"url":null,"slug":"semiparametric-discrete-choice-models-for-1","title":"Semiparametric Discrete Choice Models for Bundles","date":"2023-10-31","arxiv_id":"2311.00013","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformer-choice-net-a-transformer-neural","title":"Transformer Choice Net: A Transformer Neural Network for Choice Prediction","date":"2023-10-12","arxiv_id":"2310.08716","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-optimal-set-estimation-for-partially","title":"Sharp and Robust Estimation of Partially Identified Discrete Response Models","date":"2023-10-03","arxiv_id":"2310.02414","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-choice-multi-armed-bandits","title":"Discrete Choice Multi-Armed Bandits","date":"2023-10-01","arxiv_id":"2310.00562","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-choice-model-with-generalized","title":"Discrete-Choice Model with Generalized Additive Utility Network","date":"2023-09-29","arxiv_id":"2309.16970","repositories_listed":0,"syntology":null},{"url":null,"slug":"existence-of-a-competitive-equilibrium-with","title":"Existence of a Competitive Equilibrium with Substitutes, with Applications to Matching and Discrete Choice Models","date":"2023-09-20","arxiv_id":"2309.11416","repositories_listed":0,"syntology":null},{"url":null,"slug":"computer-vision-enriched-discrete-choice","title":"Computer vision-enriched discrete choice models, with an application to residential location choice","date":"2023-08-16","arxiv_id":"2308.08276","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-network-based-choice-model-for","title":"A Neural Network Based Choice Model for Assortment Optimization","date":"2023-08-10","arxiv_id":"2308.05617","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-based-representations-and-dynamic","title":"Network-based Representations and Dynamic Discrete Choice Models for Multiple Discrete Choice Analysis","date":"2023-06-07","arxiv_id":"2306.04606","repositories_listed":0,"syntology":null},{"url":null,"slug":"semiparametric-discrete-choice-models-for","title":"Semiparametric Discrete Choice Models for Bundles","date":"2023-06-07","arxiv_id":"2306.04135","repositories_listed":0,"syntology":null},{"url":null,"slug":"incorporating-domain-knowledge-in-deep-neural","title":"Incorporating Domain Knowledge in Deep Neural Networks for Discrete Choice Models","date":"2023-05-30","arxiv_id":"2306.00016","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-multilayer-perceptron-with-feature","title":"Enhanced multilayer perceptron with feature selection and grid search for travel mode choice prediction","date":"2023-04-25","arxiv_id":"2304.12698","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-data-driven-state-aggregation-approach-for","title":"A Data-Driven State Aggregation Approach for Dynamic Discrete Choice Models","date":"2023-04-11","arxiv_id":"2304.04916","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-estimation-of-dynamic-discrete-choice","title":"Faster estimation of dynamic discrete choice models using index invertibility","date":"2023-04-05","arxiv_id":"2304.02171","repositories_listed":0,"syntology":null},{"url":null,"slug":"attitudes-and-latent-class-choice-models","title":"Attitudes and Latent Class Choice Models using Machine learning","date":"2023-02-20","arxiv_id":"2302.09871","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-panel-data-discrete-choice-models","title":"Revisiting Panel Data Discrete Choice Models with Lagged Dependent Variables","date":"2023-01-23","arxiv_id":"2301.09379","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-data-fusion-approach-for-ride-sourcing","title":"A Data Fusion Approach for Ride-sourcing Demand Estimation: A Discrete Choice Model with Sampling and Endogeneity Corrections","date":"2022-12-05","arxiv_id":"2212.02178","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-consumer-preferences-from-bundle","title":"Learning Consumer Preferences from Bundle Sales Data","date":"2022-09-11","arxiv_id":"2209.04942","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-recursive-partitioning-approach-for-dynamic","title":"A Recursive Partitioning Approach for Dynamic Discrete Choice Modeling in High Dimensional Settings","date":"2022-08-02","arxiv_id":"2208.01476","repositories_listed":0,"syntology":null},{"url":null,"slug":"nested-bandits","title":"Nested bandits","date":"2022-06-19","arxiv_id":"2206.09348","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximating-choice-data-by-discrete-choice","title":"Approximating Choice Data by Discrete Choice Models","date":"2022-05-04","arxiv_id":"2205.01882","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-a-survey-of-preference-estimation","title":"A Note on \"A survey of preference estimation with unobserved choice set heterogeneity\" by Gregory S. Crawford, Rachel Griffith, and Alessandro Iaria","date":"2022-05-02","arxiv_id":"2205.00852","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-debiased-machine-learning-for","title":"Automatic Debiased Machine Learning for Dynamic Treatment Effects and General Nested Functionals","date":"2022-03-25","arxiv_id":"2203.13887","repositories_listed":0,"syntology":null},{"url":null,"slug":"semiparametric-bayesian-estimation-of-dynamic","title":"Semiparametric Bayesian Estimation of Dynamic Discrete Choice Models","date":"2022-02-09","arxiv_id":"2202.04339","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-permanent-unobserved-heterogeneity","title":"Continuous permanent unobserved heterogeneity in dynamic discrete choice models","date":"2022-02-08","arxiv_id":"2202.03960","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-counterfactual-estimation-in","title":"Efficient counterfactual estimation in semiparametric discrete choice models: a note on Chiong, Hsieh, and Shum (2017)","date":"2021-12-09","arxiv_id":"2112.04637","repositories_listed":0,"syntology":null},{"url":null,"slug":"yogurts-choose-consumers-estimation-of-random","title":"Yogurts Choose Consumers? Estimation of Random-Utility Models via Two-Sided Matching","date":"2021-11-26","arxiv_id":"2111.13744","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-dynamic-discrete-choice-models","title":"Identifying Dynamic Discrete Choice Models with Hyperbolic Discounting","date":"2021-11-21","arxiv_id":"2111.10721","repositories_listed":0,"syntology":null},{"url":null,"slug":"limits-of-personalization-prophet","title":"The Limits of Personalization in Assortment Optimization","date":"2021-09-30","arxiv_id":"2109.14861","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-and-analysis-of-discrete-response","title":"Modeling and Analysis of Discrete Response Data: Applications to Public Opinion on Marijuana Legalization in the United States","date":"2021-09-21","arxiv_id":"2109.10122","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-estimation-of-discrete-choice-models","title":"On the estimation of discrete choice models to capture irrational customer behaviors","date":"2021-09-08","arxiv_id":"2109.03882","repositories_listed":0,"syntology":null},{"url":null,"slug":"convex-latent-effect-logit-model-via-sparse","title":"Convex Latent Effect Logit Model via Sparse and Low-rank Decomposition","date":"2021-08-22","arxiv_id":"2108.09859","repositories_listed":0,"syntology":null},{"url":null,"slug":"nested-pseudo-likelihood-estimation-of","title":"Nested Pseudo Likelihood Estimation of Continuous-Time Dynamic Discrete Games","date":"2021-08-04","arxiv_id":"2108.02182","repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-of-average-marginal-effects-in","title":"Identification of Average Marginal Effects in Fixed Effects Dynamic Discrete Choice Models","date":"2021-07-12","arxiv_id":"2107.06141","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-unreasonable-effectiveness-of-optimal","title":"The unreasonable effectiveness of optimal transport in economics","date":"2021-07-09","arxiv_id":"2107.04700","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-social-anchors-for-human","title":"Interpretable Social Anchors for Human Trajectory Forecasting in Crowds","date":"2021-05-07","arxiv_id":"2105.03136","repositories_listed":0,"syntology":null},{"url":null,"slug":"duality-in-dynamic-discrete-choice-models","title":"Duality in dynamic discrete-choice models","date":"2021-02-08","arxiv_id":"2102.06076","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-refined-assortment-optimization-problem","title":"The Refined Assortment Optimization Problem","date":"2021-02-05","arxiv_id":"2102.03043","repositories_listed":0,"syntology":null},{"url":null,"slug":"matching-function-equilibria-with-partial","title":"Matching Function Equilibria with Partial Assignment: Existence, Uniqueness and Estimation","date":"2021-02-03","arxiv_id":"2102.02071","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparing-hundreds-of-machine-learning","title":"Comparing hundreds of machine learning classifiers and discrete choice models in predicting travel behavior: an empirical benchmark","date":"2021-02-01","arxiv_id":"2102.01130","repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-process-latent-class-choice-models","title":"Gaussian Process Latent Class Choice Models","date":"2021-01-28","arxiv_id":"2101.12252","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-choice-analysis-with-machine","title":"Discrete Choice Analysis with Machine Learning Capabilities","date":"2021-01-21","arxiv_id":"2101.10261","repositories_listed":0,"syntology":null},{"url":null,"slug":"weak-identification-in-discrete-choice-models","title":"Weak Identification in Discrete Choice Models","date":"2020-11-13","arxiv_id":"2011.06753","repositories_listed":0,"syntology":null},{"url":null,"slug":"theory-based-residual-neural-networks-a","title":"Theory-based residual neural networks: A synergy of discrete choice models and deep neural networks","date":"2020-10-22","arxiv_id":"2010.11644","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-for-large-scale-linear-systems-with","title":"Inference for Large-Scale Linear Systems with Known Coefficients","date":"2020-09-18","arxiv_id":"2009.08568","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-nonparametric-latent-class-choice-model","title":"Semi-nonparametric Latent Class Choice Model with a Flexible Class Membership Component: A Mixture Model Approach","date":"2020-07-06","arxiv_id":"2007.02739","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-logit-models-and-network-formation","title":"Mixed Logit Models and Network Formation","date":"2020-06-30","arxiv_id":"2006.16516","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-dynamic-discrete-choice-models-using","title":"Solving Dynamic Discrete Choice Models Using Smoothing and Sieve Methods","date":"2020-02-28","arxiv_id":"1904.05232","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-concavity-and-optimization-in-a-class","title":"Global Concavity and Optimization in a Class of Dynamic Discrete Choice Models","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-difference-estimation-of-dynamic","title":"Temporal-Difference estimation of dynamic discrete choice models","date":"2019-12-19","arxiv_id":"1912.09509","repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-and-inference-in-discrete","title":"Identification in discrete choice models with imperfect information","date":"2019-11-11","arxiv_id":"1911.04529","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-the-discount-factor-in-dynamic","title":"Identifying the Discount Factor in Dynamic Discrete Choice Models","date":"2019-09-16","arxiv_id":"1808.10651","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-use-of-binary-choice-forests-to-model-and","title":"The Use of Binary Choice Forests to Model and Estimate Discrete Choices","date":"2019-08-03","arxiv_id":"1908.01109","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-choice-and-welfare-analysis-with","title":"Identification and Estimation of Discrete Choice Models with Unobserved Choice Sets","date":"2019-07-09","arxiv_id":"1907.04853","repositories_listed":0,"syntology":null},{"url":null,"slug":"posterior-average-effects","title":"Posterior Average Effects","date":"2019-06-14","arxiv_id":"1906.06360","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-automatic-relevance-determination","title":"Bayesian Automatic Relevance Determination for Utility Function Specification in Discrete Choice Models","date":"2019-06-10","arxiv_id":"1906.03855","repositories_listed":0,"syntology":null},{"url":null,"slug":"demand-and-welfare-analysis-in-discrete","title":"Demand and Welfare Analysis in Discrete Choice Models with Social Interactions","date":"2019-05-10","arxiv_id":"1905.04028","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-tutorial-on-recursive-models-for-analyzing","title":"A tutorial on recursive models for analyzing and predicting path choice behavior","date":"2019-05-02","arxiv_id":"1905.00883","repositories_listed":0,"syntology":null},{"url":null,"slug":"counterfactual-sensitivity-and-robustness","title":"Counterfactual Sensitivity and Robustness","date":"2019-04-01","arxiv_id":"1904.00989","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-models-with-robust-decision-makers","title":"Dynamic Models with Robust Decision Makers: Identification and Estimation","date":"2019-01-29","arxiv_id":"1812.11246","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-deep-neural-network-to-analyze-travel","title":"Deep Neural Networks for Choice Analysis: Extracting Complete Economic Information for Interpretation","date":"2018-12-11","arxiv_id":"1812.04528","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparison-of-discrete-choice-models-and","title":"Comparison of Discrete Choice Models and Artificial Neural Networks in Presence of Missing Variables","date":"2018-11-06","arxiv_id":"1811.02284","repositories_listed":0,"syntology":null},{"url":null,"slug":"social-choice-random-utility-models-of","title":"Social Choice Random Utility Models of Intransitive Pairwise Comparisons","date":"2018-10-05","arxiv_id":"1810.02518","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-learning-and-gamification-approach-to","title":"A Deep Learning and Gamification Approach to Energy Conservation at Nanyang Technological University","date":"2018-09-13","arxiv_id":"1809.05142","repositories_listed":0,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":2,"url":"/task/discrete-choice-models/papers/2","json":"/task/discrete-choice-models/papers/2.json","rows":4}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"7a69c2b772cda0fccb657650473344ead088d1638a9ca7be3ffba3fbc88c4224","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}