We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Most research on auctions assumes that potential bidders have private information about their willingness to pay for the item being auctioned, and that they use this information s...
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
It is difficult to reach optimal outcomes in bilateral negotiations with multiple issues when the agents' preferences and priorities of the issues are not common knowledge. S...