227 search results - page 35 / 46 » Combinatorial Auctions with Budgets |
JAIR
2006
14 years 10 months ago
2006
Allocating scarce resources among agents to maximize global utility is, in general, computationally challenging. We focus on problems where resources enable agents to execute acti...
119
click to vote
STOC
2012
ACM
13 years 16 days 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...
SAGT
2009
Springer
15 years 4 months ago
2009
Springer
Roberts’ theorem from 1979 states that the only incentive compatible mechanisms over a full domain and range of at least 3 are weighted variants of the VCG mechanism termed affin...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
IOR
2011
14 years 1 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 ...