Algorithms for recursive delegation

Juan Afanador* (Corresponding Author), Murilo S. Baptista, Nir Oren

*Corresponding author for this work

Research output: Contribution to journalArticle

20 Downloads (Pure)

Abstract

Task delegation is essential to many applications, ranging from outsourcing of work to the design of routing protocols. Much research in computational trust has been devoted to the generation of policies to determine which agent should the task be delegated to, given the agent’s past behaviour. Such work, however, does not consider the possibility of the agent delegating the task onwards, inducing a chain of delegation events before the task is finally executed. In this paper, we consider the process of delegation chain formation, introducing a new algorithm based on quitting games to cater for recursive scenarios. We evaluate our proposal under various network topologies, consistently demonstrating its superiority with respect to recursive adaptations of existing multi-armed bandit algorithms.

Original languageEnglish
Pages (from-to)303-317
Number of pages15
JournalAI Communications
Volume32
Issue number4
Early online date9 Aug 2019
DOIs
Publication statusPublished - 11 Oct 2019

Keywords

  • trust
  • delegation

Fingerprint Dive into the research topics of 'Algorithms for recursive delegation'. Together they form a unique fingerprint.

  • Cite this