DBScholar

Back to papers

Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results

Summary: Partially randomized ranking for search results to give new pages a chance despite low initial popularity. Analytical and simulation studies of the exploration-exploitation tradeoff with an amortized quality objective show modest randomness improves long-run result quality. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9547
Venue
VLDB
Year
2005
Pagerank
5.7303405e-05
Overall Rank
6,977 | 52.14%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{pandey_vldb05,
        title = {{Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results}},
        author = {Pandey, Sandeep and Roy, Sourashis and Cho, Junghoo and Olston, Christopher and Chakrabarti, Soumen},
        journal = {PVLDB},
        series = {{VLDB} '05},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,680 Evolution of Page Popularity under Random Web Graph Models 2006 PODS 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
6,144 Page Quality: In Search of an Unbiased Web Ranking 2005 SIGMOD 5.9618694e-05
Previous Page 1 / 1 Next

Semantically Similar Papers