淡江大學機構典藏:Item 987654321/124082
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 64178/96951 (66%)
造访人次 : 10527224      在线人数 : 17638
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/124082


    题名: Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform
    作者: Wang, Chi-Hao;Lu, Chi-Jen;Ko, Ming-Tat;Lin, Po-An Chen and Chuang-Chieh
    关键词: Job Assignment;Budget Constraint;Cost Covering;Contribution Maximization
    日期: 2023-06-07
    上传时间: 2023-05-12 12:15:21 (UTC+8)
    摘要: We propose an optimization problem to model a situation when a platform with a limited budget wants to pay a group of workers to work on a set of jobs with possibly worker-job-dependent execution costs.
    The platform needs to assign workers to jobs and at the same time decides how much to pay each worker to maximize the total “contribution” from the workers by using up the limited budget. The binary effort assignment problem, in which an effort from a worker is indivisible and can only be dedicated to a single job, is reminiscent of bipartite matching problems. Yet, a matched worker and job pair neither incurs cost nor enforces a compulsory effort in a standard matching setting while we consider such
    cost to be covered by payment and certain level of effort to be made when a job is executed by a worker. The fractional effort assignment problem, in which generally a worker’s effort can be divisible and split among multiple jobs, bears a resemblance to a labor economy or online labor platform, and the platform needs to output an arrangement of efforts and the corresponding payments.

    There are six settings in total to consider by combining the conditions on payments and efforts. Intuitively, we study how to come up with the best assignment under each setting and how different these assignments
    under different settings can be in terms of the total contribution from workers when the information of each worker’s quality of service and cost is available. NP-completeness results and approximation algorithms are given for different settings. We then compare the solution quality of some settings in the end.
    關聯: 34th Proceedings of the International Workshop on Combinatorial Algorithms
    显示于类别:[資訊工程學系暨研究所] 會議論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML161检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈