Distributed CSPs: Why It Is Assumed a Variable per Agent?

  • Miguel A. Salido
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4612)


Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple automated agents. Many researchers assume for simplicity that each agent has exactly one variable. For real distributed problem these techniques require a large amount of messages passed among agents, so these problems are very difficult to solve. In this research summary, we question why the lack of works to manage large-scale problems.


Distributed Constraint Satisfaction Problems 


  1. 1.
    Bacchus, F., van Beek, P.: On the conversion between non-binary and binary constraint satisfaction problems. In: proceeding of AAAI-98, pp. 311–318 (1998)Google Scholar
  2. 2.
    Bessiére, C., Belaissaoui, M., Ezzahir, R., Bouyakhf, El-H.: Dischoco: A platform for distributed constraint programming. In: Proceedings of IJCAI-07 Workshop on Distributed Constraint Reasoning (2007)Google Scholar
  3. 3.
    Faltings, B., Yokoo, M.: Introduction: Special issue on distributed constraint satisfaction. Artificial Intelligence 161, 1–5 (2005)CrossRefGoogle Scholar
  4. 4.
    Salido, M.A., Barber, F.: Distributed CSPs by graph partitioning. Applied Mathematics and Computation 183, 491–498 (2006)zbMATHCrossRefGoogle Scholar
  5. 5.
    Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems 3, 185–207 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Miguel A. Salido
    • 1
  1. 1.DSIC, Technical University of Valencia, Camino de Vera s/n, 46071, ValenciaSpain

Personalised recommendations