IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v40y2020i4d10.1007_s10878-020-00645-6.html
   My bibliography  Save this article

Maximizing user type diversity for task assignment in crowdsourcing

Author

Listed:
  • Ana Wang

    (Ministry of Education
    Engineering Laboratory of Teaching Information Technology of Shaanxi Province
    Shaanxi Normal University)

  • Meirui Ren

    (Shaanxi Normal University)

  • Hailong Ma

    (Shaanxi Normal University)

  • Lichen Zhang

    (Ministry of Education
    Engineering Laboratory of Teaching Information Technology of Shaanxi Province
    Shaanxi Normal University)

  • Peng Li

    (Ministry of Education
    Engineering Laboratory of Teaching Information Technology of Shaanxi Province
    Shaanxi Normal University)

  • Longjiang Guo

    (Ministry of Education
    Engineering Laboratory of Teaching Information Technology of Shaanxi Province
    Shaanxi Normal University)

Abstract

Crowdsourcing employs numerous users to perform certain tasks, in which task assignment is a challenging issue. Existing researches on task assignment mainly consider spatial–temporal diversity and capacity diversity, but not focus on the type diversity of users, which may lead to low quality of tasks. This paper formalizes a novel task assignment problem in crowdsourcing, where a task needs the cooperation of various types of users, and the quality of a task is highly related to the various types of the recruited users. Therefore, the goal of the problem is to maximize the user type diversity subject to limited task budget. This paper uses three heuristic algorithms to try to resolve this problem, so as to maximize user type diversity. Through extensive evaluation, the proposed algorithm Unit Reward-based Greedy Algorithm by Type obviously improves the user type diversity under different user type distributions.

Suggested Citation

  • Ana Wang & Meirui Ren & Hailong Ma & Lichen Zhang & Peng Li & Longjiang Guo, 2020. "Maximizing user type diversity for task assignment in crowdsourcing," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 1092-1120, November.
  • Handle: RePEc:spr:jcomop:v:40:y:2020:i:4:d:10.1007_s10878-020-00645-6
    DOI: 10.1007/s10878-020-00645-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00645-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-020-00645-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:40:y:2020:i:4:d:10.1007_s10878-020-00645-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.