Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Hi-index | 0.01 |
We give a simple characterization of all single-item truth-revealing auctions under some mild (and natural) assumptions about the auctions. Our work opens up the possibility of using variational calculus to design auctions having desired properties.