Skip to main content

Maximizing Expected Impact in an Agent Reputation Network

  • Conference paper
  • First Online:
KI 2018: Advances in Artificial Intelligence (KI 2018)

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

  • 1220 Accesses

Abstract

We propose a new framework for reasoning about the reputation of multiple agents, based on the partially observable Markov decision process (POMDP). It is general enough for the specification of a variety of stochastic multi-agent system (MAS) domains involving the impact of agents on each other’s reputations. Assuming that an agent must maintain a good enough reputation to survive in the system, a method for an agent to select optimal actions is developed.

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

Institutional subscriptions

References

  1. Yu, H., Shen, Z., Leung, C., Miao, C., Lesser, V.: A survey of multi-agent trust management systems. IEEE Access 1, 35–50 (2013)

    Article  Google Scholar 

  2. Pinyol, I., Sabater-Mir, J.: Computational trust and reputation models for open multi-agent systems: a review. Artif. Intell. Rev. 40, 1–25 (2013)

    Article  Google Scholar 

  3. Sabater, J., Sierra, C.: Review on computational trust and reputation models. Artif. Intell. Rev. 24, 33–60 (2005)

    Article  Google Scholar 

  4. Monahan, G.: A survey of partially observable Markov decision processes: theory, models, and algorithms. Manag. Sci. 28(1), 1–16 (1982)

    Article  MathSciNet  Google Scholar 

  5. Lovejoy, W.: A survey of algorithmic methods for partially observed Markov decision processes. Ann. Oper. Res. 28, 47–66 (1991)

    Article  MathSciNet  Google Scholar 

  6. Pinyol, I., Sabater-Mir, J., Dellunde, P., Paolucci, M.: Reputation-based decisions for logic-based cognitive agents. Auton. Agents Multi-Agent Syst. 24(1), 175–216 (2012). https://doi.org/10.1007/s10458-010-9149-y

    Article  Google Scholar 

  7. Rens, G., Nayak, A., Meyer, T.: Maximizing expected impact in an agent reputation network - technical report. Technical report, University of Cape Town, Cape Town, South Africa (2018). http://arxiv.org/abs/1805.05230

  8. Yu, B., Singh, M.: An evidential model of distributed reputation management. In: Proceedings of the First International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2002, pp. 294–301. ACM, New York (2002). http://doi.acm.org/10.1145/544741.544809

  9. Regan, K., Cohen, R., Poupart, P.: The advisor-POMDP: a principled approach to trust through reputation in electronic markets. In: Conference on Privacy Security and Trust 1 (2005)

    Google Scholar 

  10. Irissappane, A., Oliehoek, F., Zhang, J.: A POMDP based approach to optimally select sellers in electronic marketplaces. In: Proceedings of the Thirteenth International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, pp. 1329–1336, International Foundation for Autonomous Agents and Multiagent Systems, Richland (2014). http://dl.acm.org/citation.cfm?id=2615731.2617459

  11. Bernstein, D., Zilberstein, S., Immerman, N.: The complexity of decentralized control of Markov decision processes. In: Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, UAI 2000, pp. 32–37, Morgan Kaufmann Publishers Inc., San Francisco (2000). http://dl.acm.org/citation.cfm?id=2073946.2073951

  12. Gmytrasiewicz, P., Doshi, P.: A framework for sequential planning in multi-agent settings. J. Artif. Intell. Res. 24(1), 49–79 (2005). http://dl.acm.org/citation.cfm?id=1622519.1622521

    Article  Google Scholar 

  13. Seymour, R., Peterson, G.: A trust-based multiagent system. In: Proceedings of International Conference on Computational Science and Engineering, pp. 109–116. IEEE (2009)

    Google Scholar 

  14. Gmytrasiewicz, P., Doshi, P.: Monte Carlo sampling methods for approximating interactive POMDPs. J. Artif. Intell. Res. 34, 297–337 (2009)

    Article  Google Scholar 

Download references

Acknowledgements

Gavin Rens was supported by a Clause Leon Foundation postdoctoral fellowship while conducting this research. This research has been partially supported by the Australian Research Council (ARC), Discovery Project: DP150104133 as well a grant from the Faculty of Science and Engineering, Macquarie University. This work is based on research supported in part by the National Research Foundation of South Africa (Grant number UID 98019). Thomas Meyer has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agr. No. 690974.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gavin Rens .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rens, G., Nayak, A., Meyer, T. (2018). Maximizing Expected Impact in an Agent Reputation Network. In: Trollmann, F., Turhan, AY. (eds) KI 2018: Advances in Artificial Intelligence. KI 2018. Lecture Notes in Computer Science(), vol 11117. Springer, Cham. https://doi.org/10.1007/978-3-030-00111-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00111-7_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00110-0

  • Online ISBN: 978-3-030-00111-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics