7 search results - page 1 / 2 » Inapproximability for VCG-Based Combinatorial Auctions |
WINE
2005
Springer
13 years 10 months ago
2005
Springer
We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to maximize the sum of t...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
SODA
2010
ACM
13 years 3 months ago
2010
ACM
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
AI
2002
Springer
13 years 4 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...