IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i1d10.1007_s10878-021-00817-y.html
   My bibliography  Save this article

Greedy algorithms for the profit-aware social team formation problem

Author

Listed:
  • Shengxin Liu

    (Harbin Institute of Technology (Shenzhen))

  • Chung Keung Poon

    (The Hang Seng University of Hong Kong)

Abstract

Motivated by applications in online labor markets, we study the problem of forming multiple teams of experts in a social network to accomplish multiple tasks that require different combinations of skills. Our goal is to maximize the total profit of tasks that are completed by these teams subject to the capacity constraints of the experts. We study both the offline and online settings of the problem. For the offline problem, we present a simple and practical algorithm that improves upon previous results in many situations. For the online problem, we design competitive deterministic and randomized online algorithms. These are complemented by some hardness results in both settings.

Suggested Citation

  • Shengxin Liu & Chung Keung Poon, 2022. "Greedy algorithms for the profit-aware social team formation problem," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 94-118, August.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00817-y
    DOI: 10.1007/s10878-021-00817-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00817-y
    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-021-00817-y?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:44:y:2022:i:1:d:10.1007_s10878-021-00817-y. 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.