This paper addresses the problem of distributed resource allocation in general fork and join processing networks. The problem is motivated by the complicated processing requiremen...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the applica...
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...