{'fraction_non_alphanumeric': 0.017055655296229804, 'fraction_numerical': 0.0, 'mean_word_length': 5.676646706586826, '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}}
Arbitrary Bilateral Bargaining in Decentralized Markets for Lemons

We investigate the efficiency of dynamic random matching and bilateral bargaining markets with adverse selection. We take a detail-free approach to the bargaining game, assuming only that: (a) each agent's actions are optimal given the equilibrium market conditions and the equilibrium strategy of the opposing agents; (b) bargaining reveals information about the quality of the object to the uninformed buyer, who cannot commit to acquire the object at a price that exceeds her expected reservation price conditional on such information. We characterize the equilibrium that maximizes the realized gains from trade among all decentralized equilibria. We show this equilibrium features full information revelation during bargaining. This equilibrium also realizes strictly more gains from trade than any equilibrium of trade under a price system, which we use as a benchmark for trade in centralized markets. However, as trading frictions vanish, the optimal decentralized market allocation converges to the optimal centralized market allocation.