Sciweavers

149 search results - page 6 / 30
» On Mechanism Design without Payments for Throughput Maximiza...
Sort
View
IOR
2010
161views more  IOR 2010»
13 years 6 months ago
Mechanism Design for Decentralized Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
VEE
2012
ACM
218views Virtualization» more  VEE 2012»
12 years 4 months ago
Enhancing TCP throughput of highly available virtual machines via speculative communication
Checkpoint-recovery based virtual machine (VM) replication is an attractive technique for accommodating VM installations with high-availability. It provides seamless failover for ...
Balazs Gerofi, Yutaka Ishikawa

Publication
341views
15 years 7 months ago
Incentive Compatible Mechanisms for Decentralized Supply Chain Formation
In this thesis, we describe a decentralized supply chain formation problem where the supply chain planner or a central design authority (CDA) is faced with the decision of choosi...
Nikesh Kumar Srivastava
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
13 years 10 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre
JAIR
2008
104views more  JAIR 2008»
13 years 8 months ago
M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems
In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agent...
Adrian Petcu, Boi Faltings, David C. Parkes