箴言
发表于 2025-3-26 21:39:55
The Complexity of Cake Cutting with Unequal Shares,eous and divisible resource, the cake, among . players who value pieces according to their own measure function. The goal is to assign each player a not necessarily connected part of the cake that the player evaluates at least as much as her proportional share..In this paper, we investigate the prob
松驰
发表于 2025-3-27 03:21:16
A Near Optimal Mechanism for Energy Aware Scheduling,mportant question is how the operator of a server should deal with combining energy-efficiency and the particular interests of the users. Consider a cloud server, where clients/agents can submit jobs for processing. The quality of service that each agent perceives is given by a non-decreasing functi
STALE
发表于 2025-3-27 06:26:18
http://reply.papertrans.cn/16/1530/152954/152954_33.png
cylinder
发表于 2025-3-27 13:08:57
http://reply.papertrans.cn/16/1530/152954/152954_34.png
轻打
发表于 2025-3-27 15:24:44
http://reply.papertrans.cn/16/1530/152954/152954_35.png
容易做
发表于 2025-3-27 21:38:32
http://reply.papertrans.cn/16/1530/152954/152954_36.png
COLIC
发表于 2025-3-27 23:05:17
http://reply.papertrans.cn/16/1530/152954/152954_37.png
向外
发表于 2025-3-28 03:55:37
A Truthful Mechanism for Interval Scheduling,ier completion times. In our model, completing a job provides a benefit equal to its present value, i.e., the value discounted to the time when the job finishes. Users submit job requirements to the cloud provider who non-preemptively schedules jobs to maximize the social welfare, i.e., the sum of p
EWER
发表于 2025-3-28 09:15:34
On Revenue-Maximizing Mechanisms Assuming Convex Costs,tance, in procurement auctions for energy, and when bidders borrow money at non-linear interest rates. We provide a 1 / 16. approximation guarantee for a prior-free randomized mechanism when bidders’ values are drawn from MHR distributions, and their costs are polynomial. Additionally, we propose tw
peptic-ulcer
发表于 2025-3-28 10:36:40
http://reply.papertrans.cn/16/1530/152954/152954_40.png