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 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.