Sciweavers

364 search results - page 2 / 73
» Mechanisms for Multi-Unit Auctions
Sort
View
AAAI
2008
15 years 4 months ago
Bidding Strategies for Realistic Multi-Unit Sealed-Bid Auctions
When autonomous agents decide on their bidding strategies in real world auctions, they have a number of concerns that go beyond the models that are normally analyzed in traditiona...
Ioannis A. Vetsikas, Nicholas R. Jennings
ACMICEC
2003
ACM
152views ECommerce» more  ACMICEC 2003»
15 years 7 months ago
Optimal clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with demand/supply function bidding
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
Viet Dung Dang, Nicholas R. Jennings
AAAI
2000
15 years 3 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
85
Voted
CI
2002
63views more  CI 2002»
15 years 1 months ago
Design of a Multi-Unit Double Auction E-Market
Pu Huang, Alan Scheller-Wolf, Katia P. Sycara
ATAL
2008
Springer
15 years 3 months ago
Computationally-efficient winner determination for mixed multi-unit combinatorial auctions
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner deter...
Andrea Giovannucci, Meritxell Vinyals, Juan A. Rod...