Bibliographic record
Abstract
Suppose that one of two prices for the same product must be posted every day. Under each price, the demand function is described by a compound Poisson process with possibly unknown parameters. The objective is to sequentially post daily prices so as to maximize the total expected, possibly discounted gross revenue over a finite pricing horizon. To effectively balance between understanding the demand function and achieving economic revenues, we formulate the optimal pricing problem with a bandit model and characterize the solution by means of stochastic dynamic programming. When there is only one unknown demand function in the model, the optimal pricing decision is determined by a pricing index, whose limit is the Gittins index. These index values also demonstrate that it may be worth sacrificing some immediate payoff for the benefit of information gathering and better-informed decisions in the future. Moreover, the optimal stopping solution is derived and the myopic strategy is shown not to be optimal in general. When both demand functions are unknown, a version of the play-the-winner pricing rule is derived.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.003 | 0.003 |
| Insufficient payload (model declined to judge) | 0.009 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".