{'fraction_non_alphanumeric': 0.034606205250596656, 'fraction_numerical': 0.0, 'mean_word_length': 4.8671328671328675, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Repeated sponsored search auction with non-decreasing bid values

We apply ascending biding behavior of English auction to solve the revenue loss problem of generalized second price auction (GSP) in repeated sponsored search auction (SSA) for the search engine provider (SEP). The mechanism proposed in this paper is denoted by Non-decreasing Sponsored Search Auction (NDSSA). We focus on analyzing SEP's revenue lower bound and auction efficiency after converging. We proof that SEP's revenue in NDSSA is at least equal to α times of that in Vickrey-Clarke-Groves auction (VCG), while α is the reciprocal of the first click-through rate (CTR). Since any CTR is normalized to a decimal, SEP in NDSSA will obtain more revenue than in VCG. Moreover, NDSSA is efficient, and advertisers with higher valuations will be ranked in better slots.