{"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/assortment-optimization","name":"Assortment Optimization","slug":"assortment-optimization","description_markdown":"Assortment optimization is all about presenting the right mix of products in the right channels at the right time.","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":32,"papers_with_code":3,"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":1,"rows_per_page":100,"shown":32,"of":32,"of_with_code":3,"tagged_in_all":32,"counts":{"archive_papers_tagged":32,"with_a_code_link":3,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":32,"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/assortment-optimization-for-patient-provider","slug":"assortment-optimization-for-patient-provider","title":"Assortment Optimization for Patient-Provider Matching","date":"2025-02-14","arxiv_id":"2502.10353","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-revenue-while-showing-relevant","slug":"optimizing-revenue-while-showing-relevant","title":"Optimizing Revenue while showing Relevant Assortments at Scale","date":"2020-03-06","arxiv_id":"2003.04736","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":"learning-an-optimal-assortment-policy-under","title":"Learning an Optimal Assortment Policy under Observational Data","date":"2025-02-10","arxiv_id":"2502.06777","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-pareto-optimality-for-the-multinomial","title":"On Pareto Optimality for the Multinomial Logistic Bandit","date":"2025-01-31","arxiv_id":"2501.19277","repositories_listed":0,"syntology":null},{"url":null,"slug":"consumer-transactions-simulation-through","title":"Consumer Transactions Simulation through Generative Adversarial Networks","date":"2024-08-07","arxiv_id":"2408.03655","repositories_listed":0,"syntology":null},{"url":null,"slug":"outer-approximation-and-super-modular-cuts","title":"Outer Approximation and Super-modular Cuts for Constrained Assortment Optimization under Mixed-Logit Model","date":"2024-07-26","arxiv_id":"2407.18532","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-re-solving-heuristic-for-dynamic-assortment","title":"A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints","date":"2024-07-08","arxiv_id":"2407.05564","repositories_listed":0,"syntology":null},{"url":null,"slug":"stop-relying-on-no-choice-and-do-not-repeat","title":"Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization","date":"2024-02-29","arxiv_id":"2402.18917","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-monotone-sequential-submodular","title":"Non-monotone Sequential Submodular Maximization","date":"2023-08-16","arxiv_id":"2308.08641","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":"a-model-of-competitive-assortment-planning","title":"A Model of Competitive Assortment Planning Algorithm","date":"2023-07-16","arxiv_id":"2307.09479","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nonparametric-stochastic-set-model","title":"Consider or Choose? The Role and Power of Consideration Sets","date":"2023-02-08","arxiv_id":"2302.04354","repositories_listed":0,"syntology":null},{"url":null,"slug":"pasta-pessimistic-assortment-optimization","title":"PASTA: Pessimistic Assortment Optimization","date":"2023-02-08","arxiv_id":"2302.03821","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-on-the-optimal-assortment-in-the","title":"Combinatorial Inference on the Optimal Assortment in Multinomial Logit Models","date":"2023-01-28","arxiv_id":"2301.12254","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-limit-of-the-marginal-distribution-model","title":"A Nonparametric Approach with Marginals for Modeling Consumer Choice","date":"2022-08-12","arxiv_id":"2208.06115","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-substitute-and-complementary","title":"Identifying Substitute and Complementary Products for Assortment Optimization with Cleora Embeddings","date":"2022-08-10","arxiv_id":"2208.06262","repositories_listed":0,"syntology":null},{"url":null,"slug":"assortment-optimization-with-customer-choice","title":"Assortment Optimization with Customer Choice Modeling in a Crowdfunding Setting","date":"2022-07-14","arxiv_id":"2207.07222","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":"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":"adversarial-combinatorial-bandits-with","title":"Adversarial Combinatorial Bandits with General Non-linear Reward Functions","date":"2021-01-05","arxiv_id":"2101.01301","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-best-of-many-worlds-dual-mirror-descent","title":"The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems","date":"2020-11-18","arxiv_id":"2011.10124","repositories_listed":0,"syntology":null},{"url":null,"slug":"product-age-based-demand-forecast-model-for","title":"Product age based demand forecast model for fashion retail","date":"2020-07-10","arxiv_id":"2007.05278","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-quantification-for-demand","title":"Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing","date":"2020-03-16","arxiv_id":"2003.07017","repositories_listed":0,"syntology":null},{"url":null,"slug":"assortment-optimization-with-repeated","title":"Assortment Optimization with Repeated Exposures and Product-dependent Patience Cost","date":"2020-02-13","arxiv_id":"2002.05321","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-markov-chain-model-to-capture","title":"A Generalized Markov Chain Model to Capture Dynamic Preferences and Choice Overload","date":"2019-11-15","arxiv_id":"1911.06716","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-dynamic-assortment-optimization-in-the","title":"Robust Dynamic Assortment Optimization in the Presence of Outlier Customers","date":"2019-10-09","arxiv_id":"1910.04183","repositories_listed":0,"syntology":null},{"url":null,"slug":"submodular-maximization-under-fading-model","title":"Cascade Submodular Maximization: Question Selection and Sequencing in Online Personality Quiz","date":"2019-01-23","arxiv_id":"1901.07708","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-assortment-optimization-with-changing","title":"Dynamic Assortment Optimization with Changing Contextual Information","date":"2018-10-31","arxiv_id":"1810.13069","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-assortment-optimization-with-logit","title":"Continuous Assortment Optimization with Logit Choice Probabilities under Incomplete Information","date":"2018-07-17","arxiv_id":"1807.06497","repositories_listed":0,"syntology":null},{"url":null,"slug":"assortment-optimization-under-unknown","title":"Assortment Optimization under Unknown MultiNomial Logit Choice Models","date":"2017-04-01","arxiv_id":"1704.00108","repositories_listed":0,"syntology":null},{"url":null,"slug":"assortment-optimization-under-the-mallows","title":"Assortment Optimization Under the Mallows model","date":"2016-12-01","arxiv_id":null,"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":[],"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":"cf41fe10430f95cca2c9a6e1d2eb19beb81d207ed10a9eec5608bf89ad971e2b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}