Skip to main content
SpringerLink
Log in
Book cover

European Conference on Multi-Agent Systems

International Conference on Agreement Technologies

EUMAS 2020, AT 2020: Multi-Agent Systems and Agreement Technologies pp 143–158Cite as

A Faithful Mechanism for Privacy-Sensitive Distributed Constraint Satisfaction Problems

  • Conference paper
  • First Online:

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

Abstract

We consider a constraint satisfaction problem (CSP) in which constraints are distributed among multiple privacy-sensitive agents. Agents are self-interested (they may reveal misleading information/constraints if that increases their benefits) and privacy-sensitive (they prefer to reveal as little information as possible). For this setting, we design a multi-round negotiation-based incentive mechanism that guarantees truthful behavior of the agents, while protecting them against unreasonable leakage of information. This mechanism possesses several desirable properties, including Bayesian incentive compatibility and individual rationality. Specifically, we prove that our mechanism is faithful, meaning that no agent can benefit by deviating from his required actions in the mechanism. Therefore, the mechanism can be implemented by selfish agents themselves, with no need for a trusted party to gather the information and make the decisions centrally.

This work was supported and funded by Samsung Electronics R&D Institute UK (SRUK).

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

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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    This leak of information may enable responders to collude with each other to alter the outcome in their favor.

  2. 2.

    It is clear that by this transformation, we have \(A'=A\).

References

  1. Brooks, R.R.: Distributed sensor networks: a multiagent perspective. Int. J. Distrib. Sens. Netw. 4 (2008)

    Google Scholar 

  2. Faltings, B., Leaute, T., Petcu, A.: Privacy guarantees through distributed constraint satisfaction. In: Web Intelligence and Intelligent Agent Technology (2008)

    Google Scholar 

  3. Farhadi, F., Golestani, S.J., Teneketzis, D.: A surrogate optimization-based mechanism for resource allocation and routing in networks with strategic agents. IEEE Trans. Autom. Control 64, 464–479 (2019)

    Google Scholar 

  4. Farhadi, F., Jennings, N.R.: A faithful mechanism for privacy-sensitive distributed constraint satisfaction problems. Technical report. https://github.com/ffarhadi20/Paper/blob/master/Main.pdf

  5. Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distrib. Comput. 18 (2002)

    Google Scholar 

  6. Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: recent results and future directions. In: DIAL (2002)

    Google Scholar 

  7. Gershman, A., Meisels, A., Zivan, R.: Asynchronous forward bounding for distributed cops. J. Artif. Intell. Res. 34, 61–88 (2009)

    Google Scholar 

  8. Gibbs, A.L., Su, F.E.: On choosing and bounding probability metrics. Int. Stat. Rev. 70 (2002)

    Google Scholar 

  9. Jennings, N., Jackson, A.: Agent-based meeting scheduling: a design and implementation. Electron. Lett. 31, 350–352 (1995)

    Google Scholar 

  10. Leaute, T., Faltings, B.: Privacy-preserving multi-agent constraint satisfaction. In: International Conference on Computational Science and Engineering, vol. 3 (2009)

    Google Scholar 

  11. Leu, S.S., Son, P.V.H., Nhung, P.T.H.: Hybrid Bayesian fuzzy-game model for improving the negotiation effectiveness of construction material procurement. J. Comput. Civ. Eng. 29 (2015)

    Google Scholar 

  12. Majumdar, D., Sen, A.: Ordinally Bayesian incentive compatible voting rules. Econometrica 72, 523–540 (2004)

    Google Scholar 

  13. Modi, P.J., Shen, W.M., Tambe, M., Yokoo, M.: Adopt: asynchronous distributed constraint optimization with quality guarantees. Artif. Intell. 161, 149–180 (2005)

    Google Scholar 

  14. Parkes, D.C., Kalagnanam, J.R., Eso, M.: Achieving budget-balance with vickrey-based payment schemes in exchanges. In: 17th IJCAI (2001)

    Google Scholar 

  15. Parkes, D.C., Shneidman, J.: Distributed implementations of vickrey-clarke-groves mechanisms. In: AAMAS (2004)

    Google Scholar 

  16. Pascal, C., Panescu, D.: On applying discsp for scheduling in holonic systems. In: 20th International Conference on System Theory, Control and Computing (2016)

    Google Scholar 

  17. Petcu, A., Faltings, B., Parkes, D.C.: M-DPOP: faithful distributed implementation of efficient social choice problems. J. Artif. Intell. Res. 32 (2008)

    Google Scholar 

  18. Pultowicz, P.: Multi-agent negotiation and optimization in decentralized logistics. Ph.D. thesis, University of Vienna (2017)

    Google Scholar 

  19. Rosenchein, J.S., Zlotkin, G.: Rules of Encounter. MIT Press, Cambridge (1994)

    Google Scholar 

  20. Rubinstein, A.: Perfect equilibrium in a bargaining model. Econometrica 50, 97–109 (1982)

    Google Scholar 

  21. Sen, S., Durfee, E.H.: A formal study of distributed meeting scheduling. Group Decis. Negot. 7, 265–289 (1998)

    Google Scholar 

  22. Singh, D.K., Mazumdar, B.D.: Agent mediated negotiation in e-commerce: a review. Int. J. Mod. Trends Eng. Res. 9, 285–301 (2017)

    Google Scholar 

  23. Teacy, W.T.L., Farinelli, A., Grabham, N.J., Padhy, P., Rogers, A., Jennings, N.R.: Max-sum decentralised coordination for sensor systems. In: 7th International Joint Conference on Autonomous Agents and Multiagent Systems (2008)

    Google Scholar 

  24. Thom-Santelli, J., Millen, D., DiMicco, J.: Removing gamification from an enterprise SNS (2012)

    Google Scholar 

  25. Yokoo, M.: Protocol/mechanism design for cooperation/competition. In: 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (2004)

    Google Scholar 

  26. Yokoo, M., Ishida, T., Durfee, E.H., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: International Conference on Distributed Computing Systems (1992)

    Google Scholar 

  27. Yokoo, M., Suzuki, K., Hirayama, K.: Secure distributed constraint satisfaction: reaching agreement without revealing private information. Artif. Intell. 161, 229–245 (2005)

    Google Scholar 

  28. Zivan, R., Okamoto, S., Peled, H.: Explorative anytime local search for distributed constraint optimization. Artif. Intell. 212, 1–26 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College London, London, UK

    Farzaneh Farhadi & Nicholas R. Jennings

Authors
  1. Farzaneh Farhadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicholas R. Jennings
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Farzaneh Farhadi .

Editor information

Editors and Affiliations

  1. Aristotle University of Thessaloniki, Thessaloniki, Greece

    Nick Bassiliades

  2. Technical University of Crete, Chania, Greece

    Georgios Chalkiadakis

  3. IIIA-CSIC, Bellaterra, Spain

    Dave de Jonge

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Farhadi, F., Jennings, N.R. (2020). A Faithful Mechanism for Privacy-Sensitive Distributed Constraint Satisfaction Problems. In: Bassiliades, N., Chalkiadakis, G., de Jonge, D. (eds) Multi-Agent Systems and Agreement Technologies. EUMAS AT 2020 2020. Lecture Notes in Computer Science(), vol 12520. Springer, Cham. https://doi.org/10.1007/978-3-030-66412-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-66412-1_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-66411-4

  • Online ISBN: 978-3-030-66412-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation