{'fraction_non_alphanumeric': 0.012195121951219513, 'fraction_numerical': 0.0, 'mean_word_length': 5.421875, '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}}
An Algebraic Approach to Revealed Preference

We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non-algebraic structure, such as topological assumptions. We provide algebraic axioms of revealed preference that subsume previous classical revealed preference axioms and show that a data set is rationalizable if and only if it is consistent with an algebraic axiom.