{'fraction_non_alphanumeric': 0.026351351351351353, 'fraction_numerical': 0.0, 'mean_word_length': 4.652671755725191, '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}}
PoA of Simple Auctions with Interdependent Values

We expand the literature on the price of anarchy (PoA) of simultaneous item auctions by considering settings with correlated values; we do this via the fundamental economic model of interdependent values (IDV).
 It is well-known that in multi-item settings with private values, correlated values can lead to bad PoA, which can be polynomially large in the number of agents~n.
 In the more general model of IDV, we show that the PoA can be polynomially large even in single-item settings.
 On the positive side, we identify a natural condition on information dispersion in the market, which enables good PoA guarantees. 
 Under this condition, we show that for single-item settings, the PoA of standard mechanisms degrades gracefully.
 For settings with multiple items we show a separation between two domains: 
 If there are more buyers, we devise a new simultaneous item auction with good PoA, under limited information asymmetry.
 To the best of our knowledge, this is the first positive PoA result for correlated values in multi-item settings.
 The main technical difficulty in establishing this result is that the standard tool for establishing PoA results --- the smoothness framework --- is unsuitable for IDV settings, and so we must introduce new techniques to address the unique challenges imposed by such settings.
 In the domain of more items, we establish impossibility results even for surprisingly simple scenarios.