Cited by 27Supply Chain and Inventory ManagementRecommender Systems and TechniquesOptimization and Search Problems

The DOI matches its Crossref record, with a small difference in title or year; 4 of the 5 references it cites were found in a registry or an index.

Targeted advertising with inventory management

Open access
Chickering, David Maxwell, Heckerman, David·2000·Proceedings of the 2nd ACM conference on Electronic commerce

Abstract

Companies that maintain web sites can make considerable revenue through advertising, and consequently attracting advertisers has become an important and competitive endeavor.A property that can attract advertisers is high clickthrough rates; and therefore companies can bene t from delivery systems that serve advertisements selectively to those visitors most likely to click.In order to satisfy contractual obligations, however, these systems must simultaneously perform inventory management.For example, if a company has agreed to serve a certain number of a particular advertisement, it must do so regardless of how likely it is to be clicked.In this paper, we describe how t o u s e a linear program to identify a schedule, based on known attributes of each visitor, that maximizes the expected number of clicks give n a l l o f t h e i n ventory-management constraints.We present experimental results using real data that demonstrate that a delivery schedule from our system realizes more clicks than a schedule that was hand constructed.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/352871.352888

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The two-model uplift approach only appears to apply to the simplest of cases.

    “Therefore, this approach only appears to apply to the simplest of cases [38]”

    From Why you should stop predicting customer churn and start using uplift models (2021) · cites this paper as [38]

    Section 2 describes a two-phase advertising-scheduling method, not a two-model uplift approach. Section 4 discusses extensions to that scheduling method, but neither section assesses whether two-model uplift applies only to simple cases. Searches for two-model uplift and its claimed limitation found no passage addressing the point. (LLM, conf=0.76)

    Experimental — accuracy not yet measured

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

Cites

Flagged first, then by citations

1 of the 5 references couldn’t be matched to a known paper.

Research works printed but not linked: 4

  1. Baudisch , P. and Leopold , D . ( 1997 ). User-con~gurable advertising pro~les applied to web page banners . In Proceedings of the First Berlin Internet Economics Workshop , Berlin. Baudisch, P. and Leopold, D. (1997). User-con~gurable advertising pro~les applied to web page banners. In Proceedings of the First Berlin Internet Economics Workshop, Berlin.
  2. Chickering , D. M. , Heckerman , D. , Meek , C. , Platt , J. C. , and Thiesson , B . ( 2000 ). Goal-oriented clustering. Technical report , MSR-TR-2000-82, Microsoft , Redmond, WA . Chickering, D. M., Heckerman, D., Meek, C., Platt, J. C., and Thiesson, B. (2000). Goal-oriented clustering. Technical report, MSR-TR-2000-82, Microsoft, Redmond, WA.
  3. Chv~atal , V. ( 1983 ). Linear Programming . W.H. Freeman and Company , New York . Chv~atal, V. (1983). Linear Programming. W.H. Freeman and Company, NewYork.
  4. 10.5555/347319.346408 · DOI

Cited by

Sorted by citations

Metadata

Authors
Chickering, D. M., & Heckerman, D.
Affiliations
Microsoft (United States) (US)
Venue
Proceedings of the 2nd ACM conference on Electronic commerce
Publisher
ACM
Published
2000-10-17
Pages
145-149
OpenAlex
W1972566533
Cited by
27
References
5
Citations by year
2024: 1 · 2018: 1 · 2017: 1 · 2016: 3 · 2015: 1 · 2014: 1 · 2012: 1
FWCI
4.75
Type
conference paper
Language
en
Open access
Locations
ACM Conference on Electronic Commerce (EC) (publishedVersion)
Topics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Supply Chain and Inventory Management
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
Keywords
targeted advertising, online advertising, inventory management, click-through rate, linear programming

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