Sciweavers

3433 search results - page 9 / 687
» Heuristics for a bidding problem
Sort
View
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
AAAI
2000
13 years 9 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
ATAL
2008
Springer
13 years 9 months 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
ATAL
2008
Springer
13 years 9 months ago
An interactive platform for auction-based allocation of loads in transportation logistics
This paper describes an agent-based platform for the allocation of loads in distributed transportation logistics, developed as a collaboration between CWI, Dutch National Center f...
Valentin Robu, Han Noot, Han La Poutré, Wil...
ATAL
2003
Springer
14 years 24 days ago
Walverine: a Walrasian trading agent
TAC-02 was the third in a series of Trading Agent Competition events fostering research in automating trading strategies by showcasing alternate approaches in an open-invitation m...
Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevi...