Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
We develop a logic for representing and reasoning about coalitional games without transferable payoffs. Although a number of logics of cooperation have been proposed over the past...
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
What if traffic lights gave you a break after you've spent a long time waiting in traffic elsewhere? In this paper we examine a variety of multi-agent traffic light controlle...
We present a general method for agents using ontologies as part of their knowledge representation to teach each other concepts to improve their communication and thus cooperation ...
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
In the context of pre-Bayesian games we analyze resource selection systems with unknown number of players. We prove the existence and uniqueness of a symmetric safety-level equili...
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...