Sciweavers

Share
ATAL
2008
Springer

Approximate bidding algorithms for a distributed combinatorial auction

8 years 5 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) for CAs are centralized. The PAUSE auction is one of a few efforts to release the auctioneer from having to do all the work. The pausebid bidding algorithm[6] generates myopically-optimal bids for agents in a PAUSE auction but its running time is exponential on the number of bids. We present new approximate bidding algorithms that not only run in linear time but also increase the utility of the bidders as result of small decrement in revenue. Categories and Subject Descriptors I.2.11 [Computing Methodologies]: Distributed Artificial Intelligence--Intelligent Agents, Multiagent Systems. Keywords Combinatorial auctions, coordination, task and resource allocation.
Benito Mendoza García, José M. Vidal
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where ATAL
Authors Benito Mendoza García, José M. Vidal
Comments (0)
books