Sciweavers

89 search results - page 1 / 18
» Robust solutions for combinatorial auctions
Sort
View
CSCLP
2004
Springer
14 years 25 days 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»
14 years 1 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»
14 years 1 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
AAAI
2000
13 years 8 months ago
Robust Combinatorial Auction Protocol against False-Name Bids
This paper presents a new combinatorial auction protocol (LDS protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commer...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
WECWIS
2006
IEEE
141views ECommerce» more  WECWIS 2006»
14 years 1 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