There is often the need to update an installed intrusion detection system (IDS) due to new
attack methods or upgraded computing environments. Since many current IDSs are …

As cloud-based services become more numerous and dynamic, resource provisioning
becomes more and more challenging. A QoS constrained resource allocation problem is …

The central problem in computational mechanism design is the tension between incentive
compatibility and computational efficiency. We establish the first significant approximability …

We consider the problem of makespan minimization on m unrelated machines in the context
of algorithmic mechanism design, where the machines are the strategic players. This is a …

This paper provides a literature overview on (direct revelation) algorithmic mechanism
design in the context of machine scheduling problems. Here, one takes a game-theoretic …

We study the mechanism design problem of scheduling tasks on n unrelated machines in
which the machines are the players of the mechanism. The problem was proposed and …

We present a game-theoretic model that captures many of the intricacies of interdomain
routing in today's Internet. In this model, the strategic agents are source nodes located on a …

We consider the problem of designing truthful mechanisms to minimize the makespan on m
unrelated machines. In their seminal paper, Nisan and Ronen [14] showed a lower bound of …

A Proof of the Nisan-Ronen Conjecture Page 1 A Proof of the Nisan-Ronen Conjecture George
Christodoulou∗ Aristotle University of Thessaloniki School of Informatics and Archimedes/RC …

We consider mechanisms without payments for the problem of scheduling unrelated
machines. Specifically, we consider truthful in expectation randomized mechanisms under …