Skip to main content

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

  • Conference paper
Abstraction, Reformulation, and Approximation (SARA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4612))

Abstract

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.

This work has been partially supported by the research projects TIN2004-06354-C02- 01 (Min. de Educacion y Ciencia, Spain-FEDER) and GV/2007/274 (G. Valenciana).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  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. 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. Faltings, B., Yokoo, M.: Introduction: Special issue on distributed constraint satisfaction. Artificial Intelligence 161, 1–5 (2005)

    Article  Google Scholar 

  4. Salido, M.A., Barber, F.: Distributed CSPs by graph partitioning. Applied Mathematics and Computation 183, 491–498 (2006)

    Article  MATH  Google Scholar 

  5. Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems 3, 185–207 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ian Miguel Wheeler Ruml

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salido, M.A. (2007). Distributed CSPs: Why It Is Assumed a Variable per Agent?. In: Miguel, I., Ruml, W. (eds) Abstraction, Reformulation, and Approximation. SARA 2007. Lecture Notes in Computer Science(), vol 4612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73580-9_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73580-9_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73579-3

  • Online ISBN: 978-3-540-73580-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics