We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mechanism-design problem to the algorithmic ...

We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination ...

May 13, 2013 · We give two sim- ple, but extremely versatile, black-box reductions, that in combination reduce the cost- sharing mechanism-design problem to ...

We give two simple, but extremely versatile, black-box reductions, that in combination re- duce the cost-sharing mechanism-design problem to the algorithmic ...

No information is available for this page. · Learn why

These reductions yield the first, or improved, polytime cost-sharing mechanisms for a variety of problems. ResearchGate Logo. Discover the world's research.

These reductions yield the first, or improved, polytime cost-sharing mechanisms for a variety of problems. Keywords: Algorithmic mechanism design; Cost-sharing ...

We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination ...

This work provides black-box reductions reducing the design of a separable cost-sharing protocols in matroid games, single-source connection games, ...

Aug 25, 2020 · We provide black-box reductions reducing the design of such a protocol to the design of an approximation algorithm for the underlying cost-minimization problem.