A Lower Bound on the Competitive Ratio of Truthful Auctions

In  21st Annual Symposium on Theoretical Aspects of Computer Science (STACS 2004)

Publisher  Springer
All copyrights reserved by Springer 2004.

Details

TypeInproceedings
URLhttp://www.springer-ny.com/
Pages644-655
Volume2996
SeriesLecture Notes in Computer Science
> Publications > A Lower Bound on the Competitive Ratio of Truthful Auctions