20 search results - page 3 / 4 » Using value queries in combinatorial auctions |
SODA
2012
ACM
12 years 9 months ago
2012
ACM
Motivated by the problem of querying and communicating bidders’ valuations in combinatorial auctions, we study how well different classes of set functions can be sketched. More...
STOC
2012
ACM
12 years 9 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...
SIGECOM
2004
ACM
15 years 11 days ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
DALT
2008
Springer
14 years 8 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
JAIR
2006
14 years 7 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...