{'fraction_non_alphanumeric': 0.01925722145804677, 'fraction_numerical': 0.0041265474552957355, 'mean_word_length': 4.91869918699187, '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}}
A simple search model of money with heterogeneous agents and partial acceptability

Summary.Simple search models have equilibria where some agents accept money and others do not. We argue such equilibria should not be taken seriously. This is unfortunate if one wants a model with partial acceptability. We introduce heterogeneous agents and show partial acceptability arises naturally and robustly. There can be multiple equilibria with different degrees of acceptability. Given the type of heterogeneity we allow, the model is simple: equilibria reduce to fixed points in [0,1]. We show that with other forms of heterogeneity equilibria are fixed points in set space, and there is no method to reduce this to a problem in R1.