147 search results - page 12 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
114
click to vote
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
HEURISTICS
2006
14 years 11 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Intern...
WINE
2007
Springer
15 years 5 months ago
2007
Springer
We study the frugality ratio of truthful mechanisms in path auctions, which measures the extent to which truthful mechanisms “overpay” compared to non-truthful mechanisms. In p...
113
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...