107 search results - page 9 / 22 » Bidding Languages for Combinatorial Auctions |
SIGECOM
2000
ACM
14 years 23 days ago
2000
ACM
Ï Ò Ò Ù Ø ÓÒ Ó ÑÙÐØ ÔÐ Ø Ñ× × Ô Ö ÓÖÑ ¸ Ø × Ó ¹ Ø Ò × Ö Ð ØÓ ÐÐÓÛ × ÓÒ ÓÑ Ò Ø ÓÒ× Ó Ø Ñ׸ × ÓÔ¹ ÔÓ× ØÓ ÓÒÐÝ ÓÒ...
ATAL
2006
Springer
14 years 4 days ago
2006
Springer
INFORMS
2010
13 years 6 months ago
2010
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
Super solutions provide a framework for finding robust solutions to Constraint Satisfaction Problems [5, 3]. We present a novel application of super solutions to combinatorial auc...
AMAI
2010
Springer
13 years 5 months ago
2010
Springer
In a combinatorial auction, a set of resources is for sale, and agents can bid on subsets of these resources. In a voting setting, the agents decide among a set of alternatives by...