Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
We analyse scenarios in which self-interested agents negotiate with each other in order to agree on deals to exchange resources. We consider two variants of the framework, one whe...
Ulrich Endriss, Nicolas Maudet, Fariba Sadri, Fran...
In this paper, we study the problem of dynamic allocation of the resources of a general parallel processing system, comprised of M heterogeneous processors and M heterogeneous tra...
Kimberly M. Wasserman, George Michailidis, Nichola...
We consider a system of compute and storage resources geographically distributed over a large number of locations connected via a wide-area network. By distributing the resources,...
Moritz Steiner, Bob Gaglianello Gaglianello, Vijay...
: This paper presents the design, implementation and evaluation of Deadline-Driven Auctions (DDA), a novel task mapping infrastructure for heterogeneous distributed environments. D...