Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Strategyproof cost-sharing mechanisms for set cover and facility location games
Proceedings of the 4th ACM conference on Electronic commerce
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Hardness results for multicast cost sharing
Theoretical Computer Science
Group Strategyproof Mechanisms via Primal-Dual Algorithms
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Mechanism design for online real-time scheduling
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Cross-monotonic cost sharing methods for connected facility location games
Theoretical Computer Science
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
New trade-offs in cost-sharing mechanisms
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Optimal Efficiency Guarantees for Network Design Mechanisms
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Optimal cost-sharing mechanisms for steiner forest problems
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Decentralization and mechanism design for online machine scheduling
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
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
Fair cost-sharing methods for scheduling jobs on parallel machines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Hi-index | 5.23 |
Classical results in economics show that no truthful mechanism can achieve budget balance and efficiency simultaneously. Roughgarden and Sundararajan recently proposed an alternative efficiency measure, which was subsequently used to exhibit that many previously known cost sharing mechanisms approximate both budget balance and efficiency. In this work, we investigate cost sharing mechanisms for combinatorial optimization problems using this novel efficiency measure, with a particular focus on scheduling problems. Our contribution is threefold: First, for a large class of optimization problems that satisfy a certain cost-stability property, we prove that no budget balanced Moulin mechanism can approximate efficiency better than @W(logn), where n denotes the number of players in the universe. Second, we present a group-strategyproof cost sharing mechanism for the minimum makespan scheduling problem that is tight with respect to budget balance and efficiency. Finally, we show a general lower bound on the budget balance factor for cost sharing methods, which can be used to prove a lower bound of @W(n) on the budget balance factor for completion and flow time scheduling objectives.