The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms
Open accessAbstract
The practice of sponsored search advertising—where advertisers pay a fee to appear alongside particular Web search results—is now one of the largest and fastest growing source of revenue for Web search engines. We model and compare several mechanisms for allocating sponsored slots, including stylized versions of those used by Overture and Google, the two biggest brokers of sponsored search. The performance of these mechanisms depends on the degree of correlation between providers’ willingness to pay and their relevance to the search term. Ranking providers based on the product of relevance and bid price performs well and is robust across varying degrees of correlation. Ranking purely based on bid price fares nearly as well when bids and relevance are positively correlated (the expected regime), and is further enhanced by adding an editorial filter. Regardless of the allocation mechanism, sponsored search revenues are lower when users’ attention decays quickly at lower ranks, emphasizing the need to develop better user interfaces and control features. The search engine can address initial inscience of relevance scores by modifying rank allocations over time as it observes clickthroughs at each rank. We propose a rank-revision strategy that weights clicks on lower ranked items more than clicks on higher ranked items. This method is shown to converge to the optimal (maximum revenue) ordering faster and more consistently than other methods.
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.
Integrity signals
Registry
Cites
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.
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
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
Breese, J. S., Heckerman, D. E., & Kadie, C. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7363 · Cited by 4,772
Accessibility of information on the web
Lawrence, S., & Giles, C. L. (1999) · Nature · doi:10.1038/21987 · Cited by 1,349
How to acquire customers on the Web.
Hoffman, D. L., & Novak, T. (2000) · PubMed · Cited by 316
A Model of Search Intermediaries and Paid Referrals
Weber, T. A., & Zheng, Z. (2007) · Information Systems Research · doi:10.1287/isre.1070.0139 · Cited by 97
Cited by
Predicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
An Empirical Analysis of Search Engine Advertising: Sponsored Search in Electronic Markets
Ghose, A., & Yang, S. (2009) · Management Science · doi:10.1287/mnsc.1090.1054 · Cited by 681
Yang, S., & Ghose, A. (2010) · Marketing Science · doi:10.1287/mksc.1090.0552 · Cited by 374
Location, Location, Location: An Analysis of Profitability of Position in Online Advertising Markets
Agarwal, A., Hosanagar, K., & Smith, M. D. (2011) · Journal of Marketing Research · doi:10.1509/jmr.08.0468 · Cited by 372
The Role of Search Engine Optimization in Search Marketing
Berman, R., & Katona, Z. (2013) · Marketing Science · doi:10.1287/mksc.2013.0783 · Cited by 262
Metadata
- Authors
- Feng, J., Bhargava, H. K., & Pennock, D. M.
- Venue
- INFORMS Journal on Computing
- Published
- 2007-02
- Volume
- 19
- Issue
- 1
- Pages
- 137-148
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2112962762
- Cited by
- 278
- References
- 4
- FWCI
- 72.76
- Type
- journal article
- Language
- en
- Open access
- green
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: Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms. https://app.cochat.ai/papers/10.1287/ijoc.1050.0135
- The paper
- Feng, J., Bhargava, H. K., & Pennock, D. M. (2007). Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms. INFORMS Journal on Computing. https://doi.org/10.1287/ijoc.1050.0135
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.