A game-based mechanism for managing 2-decomposable tasks in competitive crowdsourcing environments.

With the rapid development of social platforms and human activities, people are now interested to solve their problems with the help of the social crowd-powered system. So, crowdsourcing has become a promising way of solving problems in a distributed manner within a specific time. Crowd workers pick...

Descripción completa

Detalles Bibliográficos
Publicado en:Behaviour & Information Technology Vol. 42; no. 14; pp. 2366 - 2387
Autores principales: Mridha, Sankar Kumar, Bhattacharyya, Malay
Formato: algorithm equations & formulas pictorial research tables/charts Journal Article
Publicado: Taylor & Francis Ltd Nov2023
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=173272243&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 173272243
    longDbName: CINAHL Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    dissinfo:
    jinfo:
      jid:
        0144929X
        B6Q
      jtl: Behaviour & Information Technology
      issn: 0144929X
      maglogo: Y
    pubinfo:
      dt: Nov2023
      vid: 42
      iid: 14
      pid: 377
      pub: Taylor & Francis Ltd
      place: Philadelphia, Pennsylvania
    artinfo:
      ui:
        173272243
        159410686
        173272243
        173272243
        10.1080/0144929X.2022.2123747
        173272243
      ppf: 2366
      ppct: 21
      formats:
      tig:
        atl: A game-based mechanism for managing 2-decomposable tasks in competitive crowdsourcing environments.
      aug:
        au:
          Mridha, Sankar Kumar
          Bhattacharyya, Malay
        affil: Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India
      sug:
        subj:
          Gamification
          Crowdsourcing
          Economic Competition
          Problem Solving
          Task Performance and Analysis
          Collaboration
          Reimbursement, Incentive
          Cost Savings
          Human
          Male
          Female
          Marketing
          Teamwork
          Models, Theoretical
          Motivation
          Cost Effectiveness Analysis
          Information Technology
          Costs and Cost Analysis
          Consumer Participation
          Algorithms
          Simulations
          Work Environment
          Male
          Female
      ab: With the rapid development of social platforms and human activities, people are now interested to solve their problems with the help of the social crowd-powered system. So, crowdsourcing has become a promising way of solving problems in a distributed manner within a specific time. Crowd workers pick up a task (simple or complex) and solve it with competing interest or collaboratively and receive an incentive (as monetary or non-monetary). In paid crowdsourcing platforms, crowd workers solve complex tasks and get remunerations through prior bidding or prior announcement of fee decided by the requester (task provider). For decomposable tasks, a single winner may not provide a significant solution to the requester due to the insufficient knowledge. So, we induce collaboration in competitive crowdsourcing markets to better handle decomposable-type tasks. In this paper, we propose an envelope game-based mechanism that ensures if the tasks are decomposable then the workers will be encouraged to collaborate with their subtasks and share their remunerations. This mechanism also increases the chance of receiving more number of cost-effective solutions. Thus both the requester and crowd workers get benefits from the system. The effectiveness of the proposed mechanism is evaluated through empirical analysis on simulated environments.
      pubtype: Academic Journal
      doctype:
        algorithm
        equations & formulas
        pictorial
        research
        tables/charts
        Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N