On Scheduling Mechanisms Beyond the Worst Case

04/14/2022
by   Yansong Gao, et al.
3

The problem of scheduling unrelated machines has been studied since the inception of algorithmic mechanism design <cit.>. It is a resource allocation problem that entails assigning m tasks to n machines for execution. Machines are regarded as strategic agents who may lie about their execution costs so as to minimize their allocated workload. To address the situation when monetary payment is not an option to compensate the machines' costs, [2014] devised two truthful mechanisms, K and P respectively, that achieve an approximation ratio of n+1/2 and n, for social cost minimization. In addition, no truthful mechanism can achieve an approximation ratio better than n+1/2. Hence, mechanism K is optimal. While approximation ratio provides a strong worst-case guarantee, it also limits us to a comprehensive understanding of mechanism performance on various inputs. This paper investigates these two scheduling mechanisms beyond the worst case. We first show that mechanism K achieves a smaller social cost than mechanism P on every input. That is, mechanism K is pointwise better than mechanism P. Next, for each task j, when machines' execution costs t_i^j are independent and identically drawn from a task-specific distribution F^j(t), we show that the average-case approximation ratio of mechanism K converges to a constant. This bound is tight for mechanism K. For a better understanding of this distribution dependent constant, on the one hand, we estimate its value by plugging in a few common distributions; on the other, we show that this converging bound improves a known bound <cit.> which only captures the single-task setting. Last, we find that the average-case approximation ratio of mechanism P converges to the same constant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2017

Average-case Approximation Ratio of Scheduling without Payments

Apart from the principles and methodologies inherited from Economics and...
research
09/08/2022

Strategyproof Scheduling with Predictions

In their seminal paper that initiated the field of algorithmic mechanism...
research
06/01/2019

Average-case Analysis of the Assignment Problem with Independent Preferences

The fundamental assignment problem is in search of welfare maximization ...
research
09/25/2019

Scheduling on Two Types of Resources: a Survey

We study the problem of executing an application represented by a preced...
research
03/21/2018

A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation

In high performance computing, scheduling of tasks and allocation to mac...
research
11/17/2017

Generic algorithms for scheduling applications on heterogeneous multi-core platforms

We study the problem of executing an application represented by a preced...
research
06/07/2021

Truthful allocation in graphs and hypergraphs

We study truthful mechanisms for allocation problems in graphs, both for...

Please sign up or login with your details

Forgot password? Click here to reset