197 search results - page 13 / 40 » Bidding and allocation in combinatorial auctions |
108
click to vote
CSCLP
2004
Springer
15 years 7 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...
107
Voted
AMAI
2010
Springer
14 years 11 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...
114
click to vote
FC
2009
Springer
15 years 8 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
114
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
197
Voted
Publication
Abstract: The current art in optimal combinatorial auctions is limited to handling the case of single units of multiple items, with each bidder bidding on exactly one bundle (singl...