Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
134
click to vote
STACS
2004
Springer
99
views
Theoretical Computer Science
»
more
STACS 2004
»
A Lower Bound on the Competitive Ratio of Truthful Auctions
15 years 8 months ago
Download
www.eecs.northwestern.edu
We study a class of single-round, sealed-bid auctions for a set of identical items. We adopt the worst case competitive framework defined by [1,2] that compares the profit of an ...
Andrew V. Goldberg, Jason D. Hartline, Anna R. Kar...
claim paper
Read More »