@InProceedings{mailler04a,
  author =	 {Roger T. Mailler and Victor Lesser},
  title =	 {Using Cooperative Mediation to Solve Distributed
                  Constraint Satisfaction Problems},
  booktitle =	 {Proceedings of the Third International Joint
                  Conference on Autonomous Agents and MultiAgent
                  Systems},
  pages =	 {446--453},
  year =	 2004,
  crossref = 	 {aamas04},
  publisher =	 {{ACM}},
  abstract =	 {Distributed Constraint Satisfaction (DCSP) has long
                  been considered an important area of research for
                  multi-agent systems. This is partly due to the fact
                  that many real-world problems can be represented as
                  constraint satisfaction and partly because
                  real-world problems often present themselves in a
                  distributed form. In this paper, we present a
                  complete, distributed algorithm called {\em
                  asynchronous partial overlay (APO)} for solving
                  DCSPs that is based on a cooperative mediation
                  process. The primary ideas behind this algorithm are
                  that agents, when acting as a mediator, centralize
                  small, relevant portions of the DCSP, that these
                  centralized subproblems overlap, and that agents
                  increase the size of their subproblems along
                  critical paths within the DCSP as the problem
                  solving unfolds. We present empirical evidence that
                  shows that APO performs better than other known,
                  complete DCSP techniques.},
  keywords =     {multiagent dcsp},
  url =		 {http://jmvidal.cse.sc.edu/library/mailler04a.pdf},
  googleid = 	 {rK9OPV7Ybj0J:scholar.google.com/},
  cluster = 	 {4426713383018868652}
}