
Combining BnB-ADOPT+, with AC and FDAC levels of soft arc consistency (SAC) improves efficiency for optimal DCOP solving. However, it seems difficult in distributed context to achieve the higher consistency level EDAC, especially considering privacy. As alternative, we propose DAC by token passing. Agents receiving a token ask neighbors for cost extensions. When deletions or Cφ increments occur, the token is passed to neighbor agents. This strategy turns out to be more efficient than FDAC when combined with BnB-ADOPT+, improving communication and specially computation.