A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
We consider profit maximizing (incentive compatible) mechanism design in general environments that include, e.g., position auctions (for selling advertisements on Internet search engines) and single-minded combinatorial auctions. We analyze optimal envy-free pricings in these settings, and give economic justification for using the optimal revenue of envyfree pricings as a benchmark for prior-free mechanism design and analysis. Moreover, we show that envy-free pricing has a simple nice structuredoi:10.1145/1993574.1993612 dblp:conf/sigecom/HartlineY11 fatcat:lww4glog7rf5xdyqinp4vnpobi