Truthfulness in advertising? Approximation mechanisms for knapsack bidders.
Martin BichlerSören MertingPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- mechanism design
- auction mechanisms
- combinatorial auctions
- approximation algorithms
- knapsack problem
- dynamic programming
- packing problem
- online advertising
- optimal solution
- online auctions
- error bounds
- incomplete information
- resource allocation
- relative error
- strategy proof
- closed form
- approximation schemes
- queueing networks
- upper bound
- internet advertising
- targeted advertising
- mobile advertising