Fast winner determination for agent coordination with SBB auctions

Authors:
Kenny Daniel;Sven Koenig
Affiliations:
University of Southern California, Los Angeles, CA;University of Southern California, Los Angeles, CA
Venue:
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Year:
2009

Citing 1
Cited 1

Sequential bundle-bid single-sale auction algorithms for decentralized control

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

Coalition formation with spatial and temporal constraints

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 3 - Volume 3

Quantified Score

Hi-index	0.00

Visualization

Abstract

The runtime of winner determination for each round of a sequential bundle-bid auction (= SBB auction) has recently been shown to be linear in the number of submitted bids, which makes SBB auctions appealing for solving cooperative task-assignment problems. In this paper, we introduce the Shrewd (= SHrewd Resource Efficient Winner Determination) algorithm, whose runtime is linear in the number of submitted bids but typically much smaller than the runtime of the existing winner-determination algorithm for SBB auctions, making them feasible for larger bundle sizes.