A Lower Bound on the Competitive Ratio of Truthful Auctions.
Andrew V. GoldbergJason D. HartlineAnna R. KarlinMichael E. SaksPublished in: STACS (2004)
Keyphrases
- competitive ratio
- lower bound
- mechanism design
- combinatorial auctions
- single machine
- upper bound
- average case
- auction mechanisms
- online algorithms
- branch and bound
- branch and bound algorithm
- processing times
- worst case
- optimal solution
- np hard
- optimal strategy
- approximation algorithms
- convergence rate
- randomized algorithm
- lower and upper bounds
- scheduling problem
- objective function
- resource allocation
- special case
- bidding strategies
- data structure