Sciweavers

36 search results - page 1 / 8
» Super Solutions for Combinatorial Auctions
Sort
View
CSCLP
2004
Springer
13 years 10 months ago
Super Solutions for Combinatorial Auctions
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...
Alan Holland, Barry O'Sullivan
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
13 years 11 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
WECWIS
2005
IEEE
153views ECommerce» more  WECWIS 2005»
13 years 11 months ago
A Framework for Computing the Outcome of Proxied Combinatorial Auctions
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
Jie Zhong, Peter R. Wurman
WECWIS
2006
IEEE
141views ECommerce» more  WECWIS 2006»
13 years 11 months ago
Iterative Combinatorial Auctions with Linear Prices: Results of Numerical Experiments
Iterative Combinatorial Auctions (ICA) have been getting increasing attention in computer science and economics, as they provide an efficient solution to resource allocation prob...
Alexander Pikovsky, Pasha Shabalin, Martin Bichler
ACMICEC
2003
ACM
160views ECommerce» more  ACMICEC 2003»
13 years 10 months ago
An algorithm for computing the outcome of combinatorial auctions with proxy bidding
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
Peter R. Wurman, Gangshu Cai, Jie Zhong, Ashish Su...