SearcharxivSearch

arXiv · 2609.03285

Assortment and Procurement Design in Dual-Mode Content Platforms

Abstract

We study assortment and procurement design for a digital content platform offering both ad-supported and subscription access. Users are heterogeneous in content preferences and ad tolerance and self-select between the two modes or an outside option. For a fixed common subscription price and ad load, the platform chooses assortment distributions specific to each user type and access mode, together with content-family-level buy-versus-rent decisions to maximize profit. Rental costs scale with realized consumption, whereas buying provides a reusable pool of titles whose cost depends on the largest induced requirement across user types and modes. We show that the resulting problem is NP-hard. We then develop a scalable approximation framework based on a candidate buy set, a relaxation of the procurement coupling, and a decomposition into linear programs with a single equality constraint. These subproblems are solved by dual bisection with cardinality-constrained assortment optimization, followed by restricted-master postprocessing to recover primal feasibility. The method yields computable optimality-gap bounds, an interpretable threshold-based procurement heuristic, and asymptotic optimality under proportional market scaling as market size and grid resolution increase. Numerical experiments show strong performance at moderate market scales and grid sizes.

Explore related subjects

Keep this discovery

BibTeXRIS

Garud Iyengar, Yuanzhe Ma, Jay Sethuraman. 2026-09-03. Assortment and Procurement Design in Dual-Mode Content Platforms. https://arxiv.org/abs/2609.03285

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

DS-Lighting: Making Agent Harnesses Explicit for Data-Science Automation

Large Language Model (LLM) agents have shown promise for automating data-science workflows, yet their end-to-end performance depends critically on the agent harness that represents tasks, manages execution state, constrains output artifacts, and provides evaluation feedback. Existing data-science agents often leave this harness implicit, making results difficult to reproduce, compare, and attribute across heterogeneous tasks. We introduce DS-Lighting, a unified harness toolkit that makes harness design explicit for data-science automation. DS-Lighting decomposes the harness into four reusable layers: data, workflow, execution, and evaluation, and represents diverse agents as executable operator programs that support both predefined pipelines and adaptive search. We further integrate multiple open-source data-science benchmarks into an MLE-Bench-style task format, enabling controlled comparison under a shared task interface, sandboxed runtime, and metric protocol. Experiments across agents, harnesses, models, and ablations show that explicit harness design improves reproducibility, comparability, and reliability, while reducing avoidable system-level failures in end-to-end data-science workflows. Our code is available at https://github.com/usail-hkust/dslighting

cs.AI

Statistics of Similarity Graphs in Node-Arrival Streams

In this paper, we study several statistical problems on similarity graphs in the node-arrival streaming model, including degree moments, diversity index, degree-moment sampling, and diversity sampling. We develop constant-pass, sublinear-space streaming algorithms for these problems and establish space lower bounds that nearly match the upper bounds in their dependence on the stream length.

cs.DS