Sciweavers

197 search results - page 10 / 40
» Bidding and allocation in combinatorial auctions
Sort
View
SIGECOM
2000
ACM
127views ECommerce» more  SIGECOM 2000»
15 years 2 months 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
14 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
WINE
2007
Springer
132views Economy» more  WINE 2007»
15 years 4 months ago
Adwords Auctions with Decreasing Valuation Bids
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search eng...
Gagan Goel, Aranyak Mehta
ATAL
2006
Springer
15 years 1 months ago
A comparison between mechanisms for sequential compute resource auctions
This paper describes simulations designed to test the relative efficiency of two different sequential auction mechanisms for allocating compute resources between users in a shared...
Andrew Byde
AAAI
2000
14 years 11 months ago
An Algorithm for Multi-Unit Combinatorial Auctions
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
Kevin Leyton-Brown, Yoav Shoham, Moshe Tennenholtz