A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
State-of-the-art posted-price mechanisms for submodular bidders with m items achieve approximation guarantees of O((loglog m)^3) [Assadi and Singla, 2019]. Their truthfulness, however, requires bidders to compute an NP-hard demand-query. Some computational complexity of this form is unavoidable, as it is NP-hard for truthful mechanisms to guarantee even an m^1/2-ε-approximation for any ε > 0 [Dobzinski and Vondrák, 2016]. Together, these establish a stark distinction betweenarXiv:1910.04342v2 fatcat:ifsdqq5qbvdp5auahsyzudej6i