Abstract: Techniques for varying content item density are provided. A first minimum gap value is stored that dictates how close two content items of a first type may appear in a content item feed that contains content items of multiple types that includes the first type and a second type. The first minimum gap value is used to place content items in a first set of content item feeds. For each content item feed of the first set of content item feeds, performance data that indicates how well content items of the first type perform in the content item feed is generated. Based on the performance data and the first minimum gap value, a second minimum gap value that is different than the first minimum gap value is generated. The second minimum gap value is used to place content items in a second plurality of content item feeds.

Abstract: Technologies for optimizing content delivery to end-users are provided. Disclosed techniques include storing results of an online experiment with respect to a set of users and determining a plurality of distinct subsets of users based upon the results of the experiment. Users within each of the plurality of distinct subsets may be identified based on metric impacts of the online experiment. For each distinct subset and each associated model parameter, a utility value that represents effectiveness of the model parameter, with respect to an objective, may be determined. An objective optimization model may be used to automatically determine probabilities for each of the model parameters associated with each distinct subset. Users of a second set of users may be assigned to a distinct subset and associated model parameters may be applied to a content delivery strategies of the second set of users.

Abstract: Techniques for automatically merging multiple content item queues are provided. In one technique, a first set of content items of a first type is identified. A second set of content items of a second type that is different than first type is identified. The first set of content items and the second set of content items are merged in a content item feed. Such merging involves, for a particular slot in the content item feed: determining a previous slot that contains a first content item from the first set; determining a number of slots between the previous slot and the particular slot; based on the number of slots, generating a score for a second content item from the second set; and based on the score, determining whether to insert, into the particular slot, the second content item or a third content item from the first set of content items.

Abstract: Techniques for varying content item density are provided. A first minimum gap value is stored that dictates how close two content items of a first type may appear in a content item feed that contains content items of multiple types that includes the first type and a second type. The first minimum gap value is used to place content items in a first set of content item feeds. For each content item feed of the first set of content item feeds, performance data that indicates how well content items of the first type perform in the content item feed is generated. Based on the performance data and the first minimum gap value, a second minimum gap value that is different than the first minimum gap value is generated. The second minimum gap value is used to place content items in a second plurality of content item feeds.

Abstract: Techniques for automatically merging multiple content item queues are provided. In one technique, a first set of content items of a first type is identified. A second set of content items of a second type that is different than first type is identified. The the first set of content items and the second set of content items are merged in a content item feed. Such merging involves, for a particular slot in the content item feed: determining a previous slot that contains a first content item from the first set; determining a number of slots between the previous slot and the particular slot; based on the number of slots, generating a score for a second content item from the second set; and based on the score, determining whether to insert, into the particular slot, the second content item or a third content item from the first set of content items.