We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
In multiagent planning, it is often convenient to view a problem as two subproblems: agent local planning and coordination. Thus, we can classify agent activities into two categor...
A fundamental difficulty faced by cooperative multiagent systems is to find how to efficiently coordinate agents. There are three fundamental processes to solve the coordination pr...
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
This paper examines the decentralized formation of groups within a peer-to-peer multi-agent system. More specifically, it frames group formation as a clustering problem, and exami...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...