Sciweavers

107 search results - page 6 / 22
» Bidding Languages for Combinatorial Auctions
Sort
View
IJCAI
2001
13 years 9 months ago
Robust Multi-unit Auction Protocol against False-name Bids
This paper presents a new multi-unit auction protocol (IR protocol) that is robust against false-name bids. Internet auctions have become an integral part of Electronic Commerce a...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara
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
ECWEB
2003
Springer
151views ECommerce» more  ECWEB 2003»
14 years 1 months ago
A Combinatorial Exchange for Autonomous Traders
Abstract. Combinatorial exchanges have attracted much attention recently. However, to this point there is no generally accepted payment allocation algorithm capable of clearing com...
Andreas Tanner, Gero Mühl
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
14 years 23 days ago
Towards a universal test suite for combinatorial auction algorithms
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
Kevin Leyton-Brown, Mark Pearson, Yoav Shoham
IJCAI
2001
13 years 9 months ago
Bundle Design in Robust Combinatorial Auction Protocol against False-name Bids
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
Makoto Yokoo, Yuko Sakurai, Shigeo Matsubara