Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty
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 2×105 possible allocations in 40 seconds).
|Date of creation:||2008|
|Date of revision:|
|Contact details of provider:|| Postal: CV4 7AL COVENTRY|
Phone: +44 (0) 2476 523202
Fax: +44 (0) 2476 523032
Web page: http://www2.warwick.ac.uk/fac/soc/economics/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- d'ASPREMONT, Claude & GERARD-VARET, Louis-André, .
"Incentives and incomplete information,"
CORE Discussion Papers RP
354, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jéhiel, Philippe & Moldovanu, Benny, 1999.
"Efficient design with interdependent valuations,"
99-74, Sonderforschungsbreich 504.
- Philippe Jehiel & Benny Moldovanu, 1998. "Efficient Design with Interdependent Valuations," Discussion Papers 1244, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Jehiel, Phillipe & Moldovanu, Benny, 1999. "Efficient Design with Interdependent Valuations," Sonderforschungsbereich 504 Publications 99-74, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Jehiel, Phillipe & Moldovanu, Benny, 1998. "Efficient Design with Interdependent Valuations," Sonderforschungsbereich 504 Publications 98-22, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal, 2012. "Combinatorial agency," Journal of Economic Theory, Elsevier, vol. 147(3), pages 999-1034.
- Peter Cramton & Yoav Shoham & Richard Steinberg, 2004. "Combinatorial Auctions," Papers of Peter Cramton 04mit, University of Maryland, Department of Economics - Peter Cramton, revised 2004.
- Claudio Mezzetti, 2007.
"Mechanism Design with Interdependent Valuations: Surplus Extraction,"
Springer;Society for the Advancement of Economic Theory (SAET), vol. 31(3), pages 473-488, June.
- Claudio Mezzetti, 2005. "Mechanism Design with Interdependent Valuations: Surplus Extraction," Discussion Papers in Economics 05/1, Department of Economics, University of Leicester, revised Mar 2006.
- Claudio Mezzetti, 2004. "Mechanism Design with Interdependent Valuations: Efficiency," Econometrica, Econometric Society, vol. 72(5), pages 1617-1626, 09.
When requesting a correction, please mention this item's handle: RePEc:wrk:warwec:880. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Margaret Nash)
If references are entirely missing, you can add them using this form.