Cross-monotonic cost-sharing methods for connected facility location games
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Cross-monotonic cost sharing methods for connected facility location games
Theoretical Computer Science
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Strategyproof cost-sharing mechanisms for set cover and facility location games
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Cost sharing in a job scheduling problem using the Shapley value
Proceedings of the 6th ACM conference on Electronic commerce
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Limitations of cross-monotonic cost sharing schemes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A group-strategyproof mechanism for Steiner forests
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New trade-offs in cost-sharing mechanisms
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Complexity of constructing solutions in the core based on synergies among coalitions
Artificial Intelligence
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
ACM Transactions on Algorithms (TALG)
Proceedings of the 8th ACM conference on Electronic commerce
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the value of coordination in network design
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Limitations of cross-monotonic cost-sharing schemes
ACM Transactions on Algorithms (TALG)
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Theoretical Computer Science
Optimal Efficiency Guarantees for Network Design Mechanisms
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Encouraging Cooperation in Sharing Supermodular Costs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
Fair cost-sharing methods for scheduling jobs on parallel machines
Journal of Discrete Algorithms
Approximate mechanism design without money
Proceedings of the 10th ACM conference on Electronic commerce
A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Complexity of constructing solutions in the core based on synergies among coalitions
Artificial Intelligence
On achieving group strategyproof information dissemination in wireless networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Non-cooperative facility location and covering games
Theoretical Computer Science
Cost sharing methods for makespan and completion time scheduling
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Pricing tree access networks with connected backbones
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Buyer-supplier games: optimization over the core
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Competitive cost sharing with economies of scale
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parallel approximation algorithms for facility-location problems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cost sharing and strategyproof mechanisms for set cover games
Journal of Combinatorial Optimization
Minimal subsidies in expense sharing games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Buyer-games: Optimization over the core
Theoretical Computer Science
On approximate nash equilibria in network design
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Optimal cost-sharing mechanisms for steiner forest problems
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Black-box reductions for cost-sharing mechanism design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The algorithmic structure of group strategyproof budget-balanced cost-sharing mechanisms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
From primal-dual to cost shares and back: a stronger LP relaxation for the steiner forest problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
What about wednesday? approximation algorithms for multistage stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Fair cost-sharing methods for scheduling jobs on parallel machines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Cost sharing and strategyproof mechanisms for set cover games
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
More powerful and simpler cost-sharing methods
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Free-riders in steiner tree cost-sharing games
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
How to price shared optimizations in the cloud
Proceedings of the VLDB Endowment
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
Discrete Applied Mathematics
Non-cooperative facility location and covering games
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
The k-level facility location game
Operations Research Letters
A cost-sharing method for an economic lot-sizing game
Operations Research Letters
Price of Correlations in Stochastic Optimization
Operations Research
On budget-balanced group-strategyproof cost-sharing mechanisms
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Cost-recovering bayesian algorithmic mechanism design
Proceedings of the fourteenth ACM conference on Electronic commerce
A cross-monotonic cost-sharing scheme for the concave facility location game
Journal of Global Optimization
Approximate Mechanism Design without Money
ACM Transactions on Economics and Computation
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
| Hi-index | 0.00 |
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 methodrecovers a 1/3rd of the total cost, while in the network design game the cost shares pay for a 1/15 fraction of the cost of the solution.