Show simple item record

dc.contributor.authorRamchurn, SD
dc.contributor.authorMezzetti, C
dc.contributor.authorGiovannucci, A
dc.contributor.authorRodriguez-Aguilar, JA
dc.contributor.authorDash, RK
dc.contributor.authorJennings, NR
dc.date.available2014-05-21T22:51:44Z
dc.date.issued2009-01-01
dc.identifier.citationRamchurn, S. D., Mezzetti, C., Giovannucci, A., Rodriguez-Aguilar, J. A., Dash, R. K. & Jennings, N. R. (2009). Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty. Journal of Artificial Intelligence Research, 35, pp.119-159. https://doi.org/10.1613/jair.2751.
dc.identifier.issn1076-9757
dc.identifier.urihttp://hdl.handle.net/11343/29301
dc.description.abstract<jats:p>Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive compatible, direct mechanisms that are efficient (i.e., maximise social utility) and individually rational (i.e., agents prefer to join rather than opt out). However, an important assumption of these mechanisms is that the agents will "always" successfully complete their allocated tasks. Clearly, this assumption is unrealistic in many real-world applications, where agents can, and often do, fail in their endeavours. Moreover, whether an agent is deemed to have failed may be perceived differently by different agents. Such subjective perceptions about an agent's probability of succeeding at a given task are often captured and reasoned about using the notion of "trust". Given this background, in this paper we investigate the design of novel mechanisms that take into account the trust between agents when allocating tasks. Specifically, we develop a new class of mechanisms, called "trust-based mechanisms", that can take into account multiple subjective measures of the probability of an agent succeeding at a given task and produce allocations that maximise social utility, whilst ensuring that no agent obtains a negative utility. We then show that such mechanisms pose a challenging new combinatorial optimisation problem (that is NP-complete), devise a novel representation for solving the problem, and develop an effective integer programming solution (that can solve instances with about 2x10^5 possible allocations in 40 seconds). </jats:p>
dc.publisherAI Access Foundation
dc.subjectArtificial Intelligence and Image Processing
dc.titleTrust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty
dc.typeJournal Article
dc.identifier.doi10.1613/jair.2751
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentEconomics
melbourne.source.titleJournal of Artificial Intelligence Research
melbourne.source.volume35
melbourne.source.pages119-159
dc.research.codefor801
dc.description.pagestart119
melbourne.publicationid163679
melbourne.elementsid335003
melbourne.contributor.authorMezzetti, Claudio
dc.identifier.eissn1076-9757
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record