{'fraction_non_alphanumeric': 0.01870748299319728, 'fraction_numerical': 0.0, 'mean_word_length': 4.556603773584905, '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}}
The Family of C-Bisection Auctions: Efficiency and Running Time

In this paper we analyze the performance of a recently proposed sequential auction, called the c-bisection auction, that can be used for a sale of a single indivisible object. We discuss the running time and the efficiency in the ex-post equilibrium of the auction. We show that by changing the parameter c of the auction we can trade off efficiency against running time. Moreover, we show that the auction that gives the desired level of efficiency in expectation takes the same number of rounds for any number of players.