Cited By
View all- Panconesi ASozio M(2010)Fast primal-dual distributed algorithms for scheduling and matching problemsDistributed Computing10.1007/s00446-010-0100-x22:4(269-283)Online publication date: 1-May-2010
de Vries et al. [3] show that if valuation function of each buyer satisfies gross substitutes condition, then we can design primal-dual auctions that implement the Vickrey-Clarke-Groves (VCG) outcome. But they require prices in these auctions to be non-...
We present a combinatorial primal-dual 7-approximation algorithm for the k-level stochastic facility location problem, the stochastic counterpart of the standard k-level facility location problem. This approximation ratio is slightly worse than that of ...
We study the truthful facility assignment problem, where a set of agents with private most-preferred points on a metric space have to be assigned to facilities that lie on the metric space, under capacity constraints on the facilities. The goal is ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in