Scheduling space-sharing for internet advertising
The DOI matches its Crossref record.
Abstract
This paper provides the first in-depth study of the algorithmic questions involved in the scheduling of space-sharing for Internet advertising. We consider the scheduling problem where each advertisement is specified by a geometry and a display frequency. Given a set of ads, a schedule of the ads specifies which ads are to be displayed at the same time. The objective is find a schedule of the ads such that (1) each ad is displayed with the correct frequency, (2) each ad is allocated enough space for the specified geometry, (3) all the ads to be displayed simultaneously can be arranged in the space available for advertising. We demonstrate that an optimal schedule can be determined by finding a solution to a new variant of the bin packing problem that we introduce. In this new variant, there are a number of copies of each item to be placed into the bins. In addition to the usual bin packing requirements, all copies of an item must be placed in different bins. In this paper, we provide an efficient algorithm that finds the optimal solution to a restricted version of the new bin packing problem. This algorithm also provides a 2-approximation for the unrestricted case. We then apply this approximation to the problem of scheduling space-sharing for Internet advertising. We obtain a 2-approximation to the problem of minimizing the space requirements of a given set of ads, as well as to the problem of determining the best subset of the ads that can be scheduled with a given space constraint. We also consider an on-line version of the ad scheduling problem, where requests to purchase ad space arrive sequentially and after each request arrives, a decision must be made whether or not to sell the requested space without knowledge of future requests. We provide an algorithm that makes these decisions in a manner that is the best possible for any on-line algorithm. Copyright © 2002 John Wiley & Sons, Ltd.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Role of the Management Sciences in Research on Personalization
Murthi, B. P. S., & Sarkar, S. (2003) · Management Science · doi:10.1287/mnsc.49.10.1344.17313 · Cited by 376
Bin Packing Approximation Algorithms: Survey and Classification
Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D. (2013) · Handbook of Combinatorial Optimization · doi:10.1007/978-1-4419-7997-1_35 · Cited by 289
Zhang, T. (., Agarwal, R., & Lucas, H. C. (2011) · MIS Quarterly · doi:10.2307/41409964 · Cited by 233
Online Display Advertising Markets: A Literature Review and Future Directions
Choi, H., Mela, C. F., Balseiro, S. R., & Leary, A. (2020) · Information Systems Research · doi:10.1287/isre.2019.0902 · Cited by 181
Metadata
- Authors
- Adler, M., Gibbons, P. B., & Matias, Y.
- Venue
- Journal of Scheduling
- Publisher
- Wiley
- Published
- 2002
- Volume
- 5
- Issue
- 2
- Pages
- 103-119
- ISSN
- 1094-6136 (ISSN-L)
- 1099-1425
- OpenAlex
- W1989068254
- Cited by
- 106
- References
- 0
- FWCI
- 17.23
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Scheduling space-sharing for internet advertising. https://app.cochat.ai/papers/10.1002/jos.74
- The paper
- Adler, M., Gibbons, P. B., & Matias, Y. (2002). Scheduling space-sharing for internet advertising. Journal of Scheduling. https://doi.org/10.1002/jos.74
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.