Advertisement

Endorsement in Referral Networks

  • Ashiqur R. KhudaBukhshEmail author
  • Jaime G. Carbonell
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11450)

Abstract

Referral networks is an emerging research area in the intersection of Active Learning and Multi-Agent Systems where experts—humans or automated agents—can redirect difficult instances (tasks or queries) to appropriate colleagues. Learning-to-refer involves estimating topic-conditioned skills of colleagues connected through a referral network for effective referrals. Proactive skill posting is a learning setting where experts are allowed a one-time local network advertisement of a subset of their top skills. The learning challenge is exploiting partially available (potentially noisy) self-skill estimates, including adversarial strategic lying to attract unwarranted referrals. In this paper, we introduce the notion of endorsement typically found in professional networks where one colleague endorses another on particular topic(s). We first augment proactive skill posting with endorsements and propose modifications to existing algorithms to take advantage of such endorsements, penalizing subsequent referrals to agents with bogus skill reporting. Our results indicate that truthful endorsements improve performance as they act as an additional cushion to early failures of strong experts. When combined with truthful endorsements, extensive empirical evaluations indicate performance improvement in proactive-DIEL and \(\epsilon \)-Greedy in both market-aware and market-agnostic skill posting setting while retaining desirable properties like tolerance to noisy self-skill estimates and strategic lying.

Keywords

Active Learning Referral networks Proactive skill posting 

References

  1. 1.
    KhudaBukhsh, A.R., Carbonell, J.G., Jansen, P.J.: Robust learning in expert networks: a comparative analysis. J. Intell. Inf. Syst. 51(2), 207–234 (2018)CrossRefGoogle Scholar
  2. 2.
    KhudaBukhsh, A.R., Carbonell, J.G., Jansen, P.J.: Incentive compatible proactive skill posting in referral networks. In: Belardinelli, F., Argente, E. (eds.) EUMAS/AT -2017. LNCS, vol. 10767, pp. 29–43. Springer, Cham (2018).  https://doi.org/10.1007/978-3-030-01713-2_3CrossRefGoogle Scholar
  3. 3.
    Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002)CrossRefGoogle Scholar
  4. 4.
    Kautz, H., Selman, B., Milewski, A.: Agent amplified communication, pp. 3–9 (1996)Google Scholar
  5. 5.
    Yolum, P., Singh, M.P.: Dynamic communities in referral networks. Web Intell. Agent Syst. 1(2), 105–116 (2003)Google Scholar
  6. 6.
    Yu, B.: Emergence and evolution of agent-based referral networks. Ph.D. thesis. North Carolina State University (2002)Google Scholar
  7. 7.
    Yu, B., Venkatraman, M., Singh, M.P.: An adaptive social network for information access: theoretical and experimental results. Appl. Artif. Intell. 17, 21–38 (2003)CrossRefGoogle Scholar
  8. 8.
    Yolum, P., Singh, M.P.: Emergent properties of referral systems. In: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 592–599. ACM (2003)Google Scholar
  9. 9.
    KhudaBukhsh, A.R., Hong, J.W., Carbonell, J.G.: Market-aware proactive skill posting. In: Ceci, M., Japkowicz, N., Liu, J., Papadopoulos, G.A., Raś, Z.W. (eds.) ISMIS 2018. LNCS, vol. 11177, pp. 323–332. Springer, Cham (2018).  https://doi.org/10.1007/978-3-030-01851-1_31CrossRefGoogle Scholar
  10. 10.
    KhudaBukhsh, A.R., Carbonell, J.G.: Expertise drift in referral networks. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, pp. 425–433. International Foundation for Autonomous Agents and Multiagent Systems (2018)Google Scholar
  11. 11.
    KhudaBukhsh, A.R., Carbonell, J.G., Jansen, P.J.: Proactive-DIEL in evolving referral networks. In: Criado Pacheco, N., Carrascosa, C., Osman, N., Julián Inglada, V. (eds.) EUMAS/AT -2016. LNCS, vol. 10207, pp. 148–156. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-59294-7_13CrossRefGoogle Scholar
  12. 12.
    Langford, J., Strehl, A., Wortman, J.: Exploration scavenging. In: Proceedings of the 25th International Conference on Machine Learning, pp. 528–535. ACM (2008)Google Scholar
  13. 13.
    Shivaswamy, P., Joachims, T.: Multi-armed bandit problems with history. In: Artificial Intelligence and Statistics, pp. 1046–1054 (2012)Google Scholar
  14. 14.
    Bouneffouf, D., Feraud, R.: Multi-armed bandit problem with known trend. Neurocomputing 205, 16–21 (2016)CrossRefGoogle Scholar
  15. 15.
    Huang, L., Joseph, A.D., Nelson, B., Rubinstein, B.I., Tygar, J.: Adversarial machine learning. In: Proceedings of the 4th ACM Workshop on Security and Artificial Intelligence, pp. 43–58. ACM (2011)Google Scholar
  16. 16.
    Babaioff, M., Sharma, Y., Slivkins, A.: Characterizing truthful multi-armed bandit mechanisms. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 79–88. ACM (2009)Google Scholar
  17. 17.
    Biswas, A., Jain, S., Mandal, D., Narahari, Y.: A truthful budget feasible multi-armed bandit mechanism for crowdsourcing time critical tasks. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, pp. 1101–1109 (2015)Google Scholar
  18. 18.
    Tran-Thanh, L., Stein, S., Rogers, A., Jennings, N.R.: Efficient crowdsourcing of unknown experts using multi-armed bandits. In: European Conference on Artificial Intelligence, pp. 768–773 (2012)Google Scholar
  19. 19.
    Tran-Thanh, L., Chapman, A.C., Rogers, A., Jennings, N.R.: Knapsack based optimal policies for budget-limited multi-armed bandits. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)Google Scholar
  20. 20.
    Yolum, P., Singh, M.P.: Engineering self-organizing referral networks for trustworthy service selection. IEEE Trans. Syst. Man Cybern.-Part A: Syst. Hum. 35(3), 396–407 (2005)CrossRefGoogle Scholar
  21. 21.
    Sabater, J., Sierra, C.: Review on computational trust and reputation models. Artif. Intell. Rev. 24(1), 33–60 (2005)CrossRefGoogle Scholar
  22. 22.
    Yu, H., Shen, Z., Leung, C., Miao, C., Lesser, V.R.: A survey of multi-agent trust management systems. IEEE Access 1, 35–50 (2013)CrossRefGoogle Scholar
  23. 23.
    Wang, Y., Singh, M.P.: Trust representation and aggregation in a distributed agent system. In: AAAI, vol. 6, pp. 1425–1430 (2006)Google Scholar
  24. 24.
    Jonker, C.M., Treur, J.: Formal analysis of models for the dynamics of trust based on experiences. In: Garijo, F.J., Boman, M. (eds.) MAAMAW 1999. LNCS, vol. 1647, pp. 221–231. Springer, Heidelberg (1999).  https://doi.org/10.1007/3-540-48437-X_18CrossRefGoogle Scholar
  25. 25.
    Schillo, M., Funk, P., Rovatsos, M.: Using trust for detecting deceitful agents in artificial societies. Appl. Artif. Intell. 14(8), 825–848 (2000)CrossRefGoogle Scholar
  26. 26.
    Shi, J., Bochmann, G.V., Adams, C.: Dealing with recommendations in a statistical trust model. In: Proceedings of AAMAS Workshop on Trust in Agent Societies, pp. 144–155 (2005)Google Scholar
  27. 27.
    Mui, L., Mohtashemi, M., Halberstadt, A.: A computational model of trust and reputation. In: 2002 Proceedings of the 35th Annual Hawaii International Conference on System Sciences, HICSS, pp. 2431–2439. IEEE (2002)Google Scholar
  28. 28.
    KhudaBukhsh, A.R., Carbonell, J.G., Jansen, P.J.: Proactive skill posting in referral networks. In: Kang, B.H., Bai, Q. (eds.) AI 2016. LNCS, vol. 9992, pp. 585–596. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-50127-7_52CrossRefGoogle Scholar
  29. 29.
    Kaelbling, L.P.: Learning in Embedded Systems. MIT Press, Cambridge (1993)Google Scholar
  30. 30.
    Thompson, W.R.: On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3/4), 285–294 (1933)CrossRefGoogle Scholar
  31. 31.
    Donmez, P., Carbonell, J.G., Schneider, J.: Efficiently learning the accuracy of labeling sources for selective sampling. In: Proceedings of KDD 2009, p. 259 (2009)Google Scholar
  32. 32.
    Wiering, M., Schmidhuber, J.: Efficient model-based exploration. In: Proceedings of the Fifth International Conference on Simulation of Adaptive Behavior, SAB 1998, pp. 223–228 (1998)Google Scholar
  33. 33.
    Berry, D.A., Fristedt, B.: Bandit Problems: Sequential Allocation of Experiments (Monographs on Statistics and Applied Probability), vol. 12. Springer, Heidelberg (1985).  https://doi.org/10.1007/978-94-015-3711-7CrossRefzbMATHGoogle Scholar
  34. 34.
    MacKay, T.L., Bard, N., Bowling, M., Hodgins, D.C.: Do pokers players know how good they are? Accuracy of poker skill estimation in online and offline players. Comput. Hum. Behav. 31, 419–424 (2014)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Carnegie Mellon UniversityPittsburghUSA

Personalised recommendations