DocumentCode :
609903
Title :
Robust Reputation Mechanisms for Achieving Fair Compensation and Quality Assurance in Crowdcomputing
Author :
Vaya, S.
Author_Institution :
Xerox Res. Centre India, Bangalore, India
fYear :
2012
fDate :
14-16 Dec. 2012
Firstpage :
228
Lastpage :
235
Abstract :
The process of distributing tasks to anonymous group of people, collecting their solutions and integrating them to produce the final result is called Crowd computing. It is a promising alternative for large and small business enterprises to accomplish many different types of tasks through geographically distributed workforce with uncontracted workforce in a la pay-per-use basis, allowing them to seemlessly scale their businesses. Two primary concerns that arise in adapting crowd sourcing to accomplish important business objectives are: (a) Ascertaining that acceptable quality of work is obtained from crowd workers (b) Assigning commensurate recognition or monetary rewards to the crowd workers to nurture and maintain a reliable workforce. In this work, we propose several mechanisms to distribute tasks to crowd workers, collect their outputs and compute final results and assign payments in a manner that addresses these two concerns simultaneously. Our methods intimately involve the use of gold tasks for which answers are pre-computed. In any set of regular tasks that are to be assigned to a crowd worker an indistinguishable set of gold tasks are intermixed. We make several contributions: (a) Our first set of schemes are based largely on evaluating the responses of the crowd workers on the gold tasks and then using them to assign appropriate weights to the crowd workers. This performance measure is used to assign appropriate weights to the crowd workers. This influence factor is then used to determine how the responses of the given crowd worker are to be assimilated with the responses of other crowd workers to compute the final answers. The compensation awarded to the crowd workers may also be made to depend on this weight. These first two schemes only use the current performance of the crowd workers to decide their compensation for the assigned set of jobs, as well as for quality assurance purpose. (b) Secondly, we propose a general reputation function which takes th- number of tasks correctly and incorrectly performed by the crowd worker, till date, and maps it to an integral value. The reputation function has several features so that it penalizes poorly performing workers, spammers and scammers in such a manner that they need to considerably perform well to be assigned a positive integral value. At the same time, no worker however much lowly performing it may have been in past, is doomed for ever by the reputation function. That is the worker can start regularly performing well and raise its reputation so that he/she is compensated well etc.. The reputation function is generic in nature that it can be employed in variety of such schemes. (c) Thirdly, we design schemes that take into account both the past performance of the worker, which is reflected by the current reputation value, and the current performance, reflected by crowd workers performance on the gold tasks, to compute the answers to the regular tasks and to decide the compensation to be awarded to the crowd workers. We also describe how response times of the crowd workers in accomplishing the tasks can be incorporated in awarding them compensations.
Keywords :
business data processing; quality assurance; security of data; business enterprises; business objectives; crowdcomputing; crowdworkers; fair compensation; geographically distributed workforce; gold tasks; monetary rewards; pay-per-use basis; quality assurance; reliable workforce; reputation function; robust reputation mechanisms; scammers; spammers; uncontracted workforce; work quality; Crowdcomputing; Crowdsourcing; Fair Compensation; Gold Tasks; Quality Assurance; Reputation functions and mechanisms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Social Informatics (SocialInformatics), 2012 International Conference on
Conference_Location :
Lausanne
Print_ISBN :
978-1-4799-0234-7
Type :
conf
DOI :
10.1109/SocialInformatics.2012.50
Filename :
6542445
Link To Document :
بازگشت