Share this page
Share this page E-mail this page Print this page RSS feeds
Home > Publications > A Lower Bound on the Competitive Ratio of Truthful Auctions
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

Type: Inproceedings
URL: http://www.springer-ny.com/
Pages: 644-655
Volume: 2996
Series: Lecture Notes in Computer Science