Edinburgh Research Explorer

Algorithms for Recursive Delegation

Research output: Contribution to journalArticlepeer-review

Related Edinburgh Organisations

Open Access permissions



  • Download as Adobe PDF

    Accepted author manuscript, 967 KB, PDF document

    Licence: Creative Commons: Attribution Non-Commercial (CC-BY-NC)

Original languageEnglish
Pages (from-to)1-15
Number of pages15
JournalAI Communications
Issue numberPreprint
Publication statusPublished - 11 Oct 2019


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.

Download statistics

No data available

ID: 113766270