Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Truthful Online Scheduling with Commitments   We study online mechanisms for preemptive scheduling with deadlines, with the
goal of maximizing the total value of completed jobs. This problem is
fundamental to deadline-aware cloud scheduling, but there are strong lower
bounds even for the algorithmic problem without incentive constraints. However,
these lower bounds can be circumvented under the natural assumption of deadline
slackness, i.e., that there is a guaranteed lower bound $s > 1$ on the ratio
between a job's size and the time window in which it can be executed.
  In this paper, we construct a truthful scheduling mechanism with a constant
competitive ratio, given slackness $s > 1$. Furthermore, we show that if $s$ is
large enough then we can construct a mechanism that also satisfies a commitment
property: it can be determined whether or not a job will finish, and the
requisite payment if so, well in advance of each job's deadline. This is
notable because, in practice, users with strict deadlines may find it
unacceptable to discover only very close to their deadline that their job has
been rejected.

33
The categories of this paper are: plasm-ph
8
The categories of this paper are: hep-ex
16
The categories of this paper are: stat
17
The categories of this paper are: q-fin
25
The categories of this paper are: patt-sol
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
5
The categories of this paper are: gr-qc
15
The categories of this paper are: nucl-ex
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
35
The categories of this paper are: mtrl-th