An Adversarial Algorithm for Delegation

Juan Afanador, Murilo Baptista, Nir Oren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Task delegation lies at the heart of the service economy, and is a fundamental aspect of many agent marketplaces. Research in computational trust considers which agent a task should be delegated to for execution, given the agent’s past behaviour. However, such work does not consider the effects of the agent delegating the task onwards, forming a chain of delegations before the task is finally executed (as occurs in many human outsourcing scenarios). In this paper we consider such delegation chains, and empirically demonstrate that existing trust based approaches do not handle these situations as well. We then introduce a new algorithm based on quitting games, to cater for recursive delegation.
Original languageEnglish
Title of host publicationAgreement Technologies
Subtitle of host publication6th International Conference, AT 2018, Bergen, Norway, December 6-7, 2018, Revised Selected Papers
EditorsMarin Lujak
Place of PublicationCham
PublisherSpringer
Pages130-145
Number of pages16
ISBN (Electronic)9783030172947
ISBN (Print)9783030172930
DOIs
Publication statusPublished - 2019
Event6th International Conference on Agreement Technologies - University of Bergen, Bergen, Norway
Duration: 6 Dec 20187 Dec 2018

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11327
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Agreement Technologies
Abbreviated titleAT 2018
CountryNorway
CityBergen
Period6/12/187/12/18

Fingerprint

Outsourcing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Afanador, J., Baptista, M., & Oren, N. (2019). An Adversarial Algorithm for Delegation. In M. Lujak (Ed.), Agreement Technologies: 6th International Conference, AT 2018, Bergen, Norway, December 6-7, 2018, Revised Selected Papers (pp. 130-145). (Lecture Notes in Computer Science; Vol. 11327). Cham: Springer . https://doi.org/10.1007/978-3-030-17294-7_10

An Adversarial Algorithm for Delegation. / Afanador, Juan; Baptista, Murilo; Oren, Nir.

Agreement Technologies: 6th International Conference, AT 2018, Bergen, Norway, December 6-7, 2018, Revised Selected Papers. ed. / Marin Lujak. Cham : Springer , 2019. p. 130-145 (Lecture Notes in Computer Science; Vol. 11327).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Afanador, J, Baptista, M & Oren, N 2019, An Adversarial Algorithm for Delegation. in M Lujak (ed.), Agreement Technologies: 6th International Conference, AT 2018, Bergen, Norway, December 6-7, 2018, Revised Selected Papers. Lecture Notes in Computer Science, vol. 11327, Springer , Cham, pp. 130-145, 6th International Conference on Agreement Technologies, Bergen, Norway, 6/12/18. https://doi.org/10.1007/978-3-030-17294-7_10
Afanador J, Baptista M, Oren N. An Adversarial Algorithm for Delegation. In Lujak M, editor, Agreement Technologies: 6th International Conference, AT 2018, Bergen, Norway, December 6-7, 2018, Revised Selected Papers. Cham: Springer . 2019. p. 130-145. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-030-17294-7_10
Afanador, Juan ; Baptista, Murilo ; Oren, Nir. / An Adversarial Algorithm for Delegation. Agreement Technologies: 6th International Conference, AT 2018, Bergen, Norway, December 6-7, 2018, Revised Selected Papers. editor / Marin Lujak. Cham : Springer , 2019. pp. 130-145 (Lecture Notes in Computer Science).
@inproceedings{ab7a03cbd212417984a1757a71db11de,
title = "An Adversarial Algorithm for Delegation",
abstract = "Task delegation lies at the heart of the service economy, and is a fundamental aspect of many agent marketplaces. Research in computational trust considers which agent a task should be delegated to for execution, given the agent’s past behaviour. However, such work does not consider the effects of the agent delegating the task onwards, forming a chain of delegations before the task is finally executed (as occurs in many human outsourcing scenarios). In this paper we consider such delegation chains, and empirically demonstrate that existing trust based approaches do not handle these situations as well. We then introduce a new algorithm based on quitting games, to cater for recursive delegation.",
author = "Juan Afanador and Murilo Baptista and Nir Oren",
year = "2019",
doi = "10.1007/978-3-030-17294-7_10",
language = "English",
isbn = "9783030172930",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "130--145",
editor = "Marin Lujak",
booktitle = "Agreement Technologies",

}

TY - GEN

T1 - An Adversarial Algorithm for Delegation

AU - Afanador, Juan

AU - Baptista, Murilo

AU - Oren, Nir

PY - 2019

Y1 - 2019

N2 - Task delegation lies at the heart of the service economy, and is a fundamental aspect of many agent marketplaces. Research in computational trust considers which agent a task should be delegated to for execution, given the agent’s past behaviour. However, such work does not consider the effects of the agent delegating the task onwards, forming a chain of delegations before the task is finally executed (as occurs in many human outsourcing scenarios). In this paper we consider such delegation chains, and empirically demonstrate that existing trust based approaches do not handle these situations as well. We then introduce a new algorithm based on quitting games, to cater for recursive delegation.

AB - Task delegation lies at the heart of the service economy, and is a fundamental aspect of many agent marketplaces. Research in computational trust considers which agent a task should be delegated to for execution, given the agent’s past behaviour. However, such work does not consider the effects of the agent delegating the task onwards, forming a chain of delegations before the task is finally executed (as occurs in many human outsourcing scenarios). In this paper we consider such delegation chains, and empirically demonstrate that existing trust based approaches do not handle these situations as well. We then introduce a new algorithm based on quitting games, to cater for recursive delegation.

UR - http://www.scopus.com/inward/record.url?scp=85064945877&partnerID=8YFLogxK

UR - http://www.mendeley.com/research/adversarial-algorithm-delegation

UR - https://abdn.pure.elsevier.com/en/en/researchoutput/an-adversarial-algorithm-for-delegation(ab7a03cb-d212-4179-84a1-757a71db11de).html

UR - http://pure-ots.abdn.ac.uk:8080/portal/en/researchoutput/an-adversarial-algorithm-for-delegation(ab7a03cb-d212-4179-84a1-757a71db11de).html

U2 - 10.1007/978-3-030-17294-7_10

DO - 10.1007/978-3-030-17294-7_10

M3 - Conference contribution

SN - 9783030172930

T3 - Lecture Notes in Computer Science

SP - 130

EP - 145

BT - Agreement Technologies

A2 - Lujak, Marin

PB - Springer

CY - Cham

ER -