{'fraction_non_alphanumeric': 0.018494055482166448, 'fraction_numerical': 0.005284015852047556, 'mean_word_length': 6.018518518518518, '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}}
On Rational Computability and Communication Complexity

We investigate the power of market mechanisms—and auctions in particular—to compute various functions. The specific contributions of this paper are twofold. From the conceptual standpoint, we identify a new type of computational resource in a distributed setting—namely willingness of various parties to disclose information necessary for the computation. From the technical standpoint, we present a number of results concerning the communication complexity of rational computation. The proof technique in these theorems is novel, in that it calls for constructing innovative auction mechanisms and studying their equilibria strategies. Journal of Economic Literature Classification Numbers: C72, C82.