Agent competition and coordination are two classical and most important tasks in multiagent systems. In recent years, there was a number of learning algorithms proposed to resolve ...
— Delegating the coordination role to proxy agents can improve the overall outcome of the task at the expense of cognitive overload due to switching subtasks. Stability and commi...
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
This paper describes a novel algorithm for activity coordination in multiagent systems that combines joint planning and joint learning. The basic idea underlying this algorithm is...
We develop a cyclical blockwise coordinate descent algorithm for the multi-task Lasso that efficiently solves problems with thousands of features and tasks. The main result shows ...