4 search results - page 1 / 1 » Truthful Mechanisms via Greedy Iterative Packing |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
FOCS
2005
IEEE
13 years 10 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...