Sciweavers

7 search results - page 2 / 2
» Approximately Strategy-proof Mechanisms for (Constrained) Fa...
Sort
View
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 11 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
COMPGEOM
2006
ACM
14 years 2 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...