Sciweavers

549 search results - page 4 / 110
» Computational Bundling for Auctions
Sort
View

Publication
509views
15 years 9 months ago
Some Issues in Auctions with Manipulative Players
Some Issues in Auctions with Manipulative Players
Aly Farag
IJCAI
2001
13 years 11 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
AMEC
2004
Springer
14 years 3 months ago
An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Abstract. Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctio...
Adam I. Juda, David C. Parkes
IJCAI
2007
13 years 11 months ago
Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
Sven Koenig, Craig A. Tovey, Xiaoming Zheng, Ilgaz...
IJCAI
2001
13 years 11 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