-
Notifications
You must be signed in to change notification settings - Fork 2.4k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Round robin ads delivery #5945
Comments
@tmancey Is there a way of telling whether duplicate ad is shown after round robin? I contrast to simply showing a duplicate ad? |
@tmancey Thank you for the call, it was really helpful. Based on it I wrote a detailed test plan. Setting up ads catalog
Setting Charles proxy
Test Case 1 - one set
Note: There are 4 ads in the set for Expected behavior Example for 4 ads in the segment:
Test Case 2 - two sets of the same segment type
Note: There are 2 ads per set for Expected behavior Example for 4 ads in the segment:
Test Case 3 - one ad for the segment
Note: There is an ad in the set for Expected behavior Test Case 4 - two sets of different segment types Note: the point of this TC is to check if round robins from different segments interfere with each other
Expected result: Example: Now divide by segments and search for duplicates within pairs: PF T1 PF T1
A&E T2 |
Verification passed on
Verified test plan from #5945 (comment) Verification passed on
Verified test plan from #5945 (comment) Verification PASSED on
|
Description
Right now, the ad libraries will take a look at ads eligible to serve and will randomly select eligible ones. However, sometimes this results in seeing the same ad multiple times in a row. We should try to round robin deliver eligible ads instead so they are seen more evenly by the user.
So for all ads which have not yet reached frequency cap, we should first choose ads that have been seen the least over the observation window. The new algorithm would look as follows.
The text was updated successfully, but these errors were encountered: