Algorithms for recursive delegation

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

*Corresponding author for this work

Research output: Contribution to journalArticle

3 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

Fingerprint

Outsourcing
Routing protocols
Topology

Keywords

  • trust
  • delegation

Cite this

Algorithms for recursive delegation. / Afanador, Juan (Corresponding Author); Baptista, Murilo S.; Oren, Nir.

In: AI Communications, Vol. 32, No. 4, 11.10.2019, p. 303-317.

Research output: Contribution to journalArticle

Afanador, Juan ; Baptista, Murilo S. ; Oren, Nir. / Algorithms for recursive delegation. In: AI Communications. 2019 ; Vol. 32, No. 4. pp. 303-317.
@article{d372b92442774d929b6165c877259c41,
title = "Algorithms for recursive delegation",
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.",
keywords = "trust, delegation",
author = "Juan Afanador and Baptista, {Murilo S.} and Nir Oren",
year = "2019",
month = "10",
day = "11",
doi = "10.3233/AIC-190616",
language = "English",
volume = "32",
pages = "303--317",
journal = "AI Communications",
issn = "0921-7126",
publisher = "IOS Press",
number = "4",

}

TY - JOUR

T1 - Algorithms for recursive delegation

AU - Afanador, Juan

AU - Baptista, Murilo S.

AU - Oren, Nir

PY - 2019/10/11

Y1 - 2019/10/11

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

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

KW - trust

KW - delegation

UR - http://pure-ots.abdn.ac.uk:8080/portal/en/researchoutput/algorithms-for-recursive-delegation(d372b924-4277-4d92-9b61-65c877259c41).html

UR - http://www.mendeley.com/research/algorithms-recursive-delegation

U2 - 10.3233/AIC-190616

DO - 10.3233/AIC-190616

M3 - Article

VL - 32

SP - 303

EP - 317

JO - AI Communications

JF - AI Communications

SN - 0921-7126

IS - 4

ER -