Sciweavers

227 search results - page 3 / 46
» Combinatorial Auctions with Budgets
Sort
View
ACMICEC
2003
ACM
152views ECommerce» more  ACMICEC 2003»
15 years 3 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
ATAL
2008
Springer
15 years 2 days ago
Approximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
Benito Mendoza García, José M. Vidal
WECWIS
2006
IEEE
141views ECommerce» more  WECWIS 2006»
15 years 4 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
ATAL
2008
Springer
15 years 2 days ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
ATAL
2010
Springer
14 years 11 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson