Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty
Ramchurn, Sarvapali D., Dash, Rajdeep K., Jennings, Nick, Giovannucci, Andrea, Rodríguez-Aguilar, Juan A. and Mezzetti, Claudio (2008) Trust-based mechanisms for robust and efficient task allocation in the presence of execution uncertainty. Working Paper. Coventry: University of Warwick, Department of Economics. Warwick economic research papers (No.880).
WRAP_Dash_twerp_880.pdf - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Official URL: http://www2.warwick.ac.uk/fac/soc/economics/resear...
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).
|Item Type:||Working or Discussion Paper (Working Paper)|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||Faculty of Social Sciences > Economics|
|Library of Congress Subject Headings (LCSH):||Mathematical sociology, Combinatorial optimization, Utilitarianism, Statistical mechanics, Assignment problems (Programming)|
|Series Name:||Warwick economic research papers|
|Publisher:||University of Warwick, Department of Economics|
|Place of Publication:||Coventry|
|Number of Pages:||38|
|Status:||Not Peer Reviewed|
|Access rights to Published version:||Open Access|
 A. Archer, C. Papadimitriou, K. Talwar, and E. Tardos. An approximate truthful mechanism
Actions (login required)