Sciweavers

12 search results - page 3 / 3
» On the Hardness of Welfare Maximization in Combinatorial Auc...
Sort
View
ATAL
2007
Springer
13 years 11 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal
FOCS
2006
IEEE
13 years 11 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák