163 search results - page 19 / 33 » Approximate bidding algorithms for a distributed combinatori... |
SIGECOM
2011
ACM
12 years 10 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
ATAL
2005
Springer
14 years 28 days ago
2005
Springer
We present a novel approach to multiagent planning for self-interested agents. The main idea behind our approach is that multiagent planning systems should be built upon (single-a...
IOR
2011
12 years 10 months ago
2011
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
APPROX
2009
Springer
14 years 2 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 ...
FOCS
2005
IEEE
14 years 1 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 ...