MétaCan
Menu
Back to cohort
Record W3121479382 · doi:10.1111/poms.12958

On the Benefit (Or Cost) of Large‐Scale Bundling

2018· article· en· W3121479382 on OpenAlex
Tarek Abdallah

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueProduction and Operations Management · 2018
Typearticle
Languageen
FieldBusiness, Management and Accounting
TopicDigital Platforms and Economics
Canadian institutionsKellogg's (Canada)
Fundersnot available
KeywordsComputer scienceAnalyticsSimple (philosophy)BundleMechanism (biology)Limit (mathematics)MicroeconomicsProfit (economics)Mechanism designMathematical optimizationEconometricsEconomicsMathematicsData mining

Abstract

fetched live from OpenAlex

Simple selling mechanisms are very appealing in practice, yet they may limit the firm’s ability to extract a large consumer surplus. In this paper, we study the efficiency of a simple pure bundling mechanism in extracting the consumer surplus in the presence of nonnegative marginal costs and correlated valuations. The main question we address is how to quantify the benefits of adopting a simple pure bundling mechanism relative to other more complicated mechanisms, such as mixed bundling. We develop simple robust analytics that identify the main drivers for the efficiency of the pure bundling mechanism and allow the sellers to easily quantify the potential profit of a large‐scale bundling mechanism relative to more complicated selling mechanisms. Our numerical simulations show that these analytics provide high predictive power for the true performance of the bundling mechanism and are robust to different parametric assumptions even for relatively small bundles. For example, for a bundle of 1200 and 12,000 items, the medians of the prediction error of our tight bound are −0.021 and 0.041 while the interquartile ranges are 0.094 and 0.067, respectively.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.893
Threshold uncertainty score0.346

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.022
GPT teacher head0.228
Teacher spread0.206 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it