(Enter summary)
Abstract: We develop a general method for turning a primal-dual
algorithm into a group strategyproof cost-sharing mechanism.
We use our method to design approximately budget
balanced cost sharing mechanisms for two NP-complete
problems: metric facility location, and single source rentor
-buy network design. Both mechanisms are competitive,
group strategyproof and recover a constant fraction of the
cost. For the facility location game our cost-sharing method
recovers a 1/3rd of the total cost, while in... (Update)
Similar documents based on text: More All
0.6: Group Strategyproof Mechanisms via Primal-Dual Algorithms - Pal, Tardos (2003)
(Correct)
0.5: Lower Bounds for Cost Sharing and Group-Strategyproof.. - Immorlica, Mahdian..
(Correct)
0.4: Group Strategyproofness and No Subsidy via LP-Duality - Jain, Vazirani (1999)
(Correct)
BibTeX entry: (Update)
Martin Pal and Eva Tardos. Group strategyproof mechanisms via primal-dual algorithms. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 584--593, 2003. http://citeseer.ist.psu.edu/pal03group.html More
@misc{ pal03group,
author = "M. Pal and E. Tardos",
title = "Group strategyproof mechanisms via primal-dual algorithms",
text = "Martin Pal and Eva Tardos. Group strategyproof mechanisms via primal-dual
algorithms. In Proceedings of the 44th Annual IEEE Symposium on Foundations
of Computer Science, pages 584--593, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/pal03group.html" }
Citations (may not include all citations):
244
median problem: new insights and continuity properties (context) - Archer, Rajagopalan et al. - 2003
194
Hierarchical Placement and Network Design Problems 41st IEEE..
- Guha, Meyerson et al. - 2000
160
A General Approximation Technique for Constrained Forest Pro..
- Goemans, Williamson - 1995
160
Simpler and Better Approximation Algorithms for Network Desi..
- Gupta, Kumar et al. - 2003
86
Primal-Dual Approximation Algorithms for Metric Facility Loc..
- Jain, Vazirani - 2001
79
When Trees Collide: An approximation algorithm for the gener..
- Agrawal, Klein et al. - 1995
39
Strategyproof sharing of submodular costs: budget balance ve..
- Moulin, Shenker - 2001
38
Primal-dual Algorithms for Connected Facility Location Probl.. (context) - Swamy, Kumar - 2002
37
Applications of Approximation Algorithms to Cooperative Game..
- Jain, Vazirani - 2001
26
Building Steiner trees with incomplete global knowledge (context) - Karger, Minkoff - 2000
24
The online median problem
- Mettu, Plaxton - 2000
22
a Network Creation Game (context) - Fabrikant, Luthra et al.
21
Cooperative Facility Location Games
- Goemans, Skutella - 2000
16
A Non-Cooperative Model of Network Formation (context) - Bala, Goyal - 2000
13
Near-Optimal Network Design with Selfish Agents
- Anshelevich, Dasgupta et al. - 2003
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cornell.edu/People/eva/eva.html): More
An Approximate Truthful Mechanism for.. - Archer.. (2003)
(Correct)
Bounding the Inefficiency of Equilibria in Nonatomic.. - Roughgarden, Tardos (2002)
(Correct)
The Price of Stability for Network Design with Fair .. - Anshelevich.. (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC