The Retail Space‐Exchange Problem with Pricing and Space Allocation Decisions
Bibliographic record
Abstract
We consider retail space‐exchange problems where two retailers exchange shelf space to increase accessibility to more of their consumers in more locations without opening new stores. Using the Hotelling model, we find two retailers’ optimal prices, given their host and guest space in two stores under the space‐exchange strategy. Next, using the optimal space‐dependent prices, we analyze a non‐cooperative game, where each retailer makes a space allocation decision for the retailer's own store. We show that the two retailers will implement such a strategy in the game, if and only if their stores are large enough to serve more than one‐half of their consumers. Nash equilibrium for the game exists, and its value depends on consumers’ utilities and trip costs as well as the total available space in each retailer's store. Moreover, as a result of the space‐exchange strategy, each retailer's prices in two stores are both higher than the retailer's price before the space exchange, but they may or may not be identical.
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.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.004 | 0.007 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.005 | 0.003 |
| Insufficient payload (model declined to judge) | 0.010 | 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".