Search
 
loader loading subjects...
cover
Robustness in Recurrent Auctions for Resource Allocation
Victor Muñoz, Dídac Busquets
70 - 79
10.3233/978-1-58603-925-7-70
Frontiers in Artificial Intelligence and Applications
Volume 184: Artificial Intelligence Research and Development
Abstract

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.

$35.00 / €27.50 / £22.00
Add PDF to cart