Resource allocation problems where resources have to be assigned to tasks in such a way that no resource gets overused can be solved using recurrent auctions. In dynamic environments where unexpected changes may occur, searching the optimal solution may not be the best choice as it would be more likely to fail. In these cases a robust solution is preferable. In this paper we present a robustness mechanism for auctions, producing feasible and near optimal solutions even if non-planned events occur.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com