Abstract
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of group-strategyproof, budget-balanced mechanisms. We also extend a classical impossibility result in game theory to show that no strategyproof mechanism can be both approximately efficient and approximately budget-balanced.
This work was supported by the DoD University Research Initiative (URI) program administered by the Office of Naval Research under Grant N00014-01-1-0795. A full version of this paper has been submitted for journal publication [4].
Supported in part by ONR grants N00014-01-1-0795 and N00014-01-1-0447 and NSF grants CCR-0105337, CCR-TC-0208972, ANI-0207399, and ITR-0219018.
Supported in part by NSF grants CCR-9985304, ANI-0207399, and CCR-0209122.
Supported by NSF Career grant CCR-9702980 and ONR grant N00014-01-1-0795.
Supported in part by NSF grants ANI-9730162, ITR-0081698, ITR-0121555, and ANI-0207399.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adler, M. and Rubenstein, D. (2002). “Pricing Multicast in More Practical Network Models,” in Proceedings of the 13th Symposium on Discrete Algorithms, pp. 981–990, ACM Press/SIAM, New York/Philadelphia.
Archer, A., Feigenbaum, J., Krishnamurthy, A., Sami, R., and Shenker, S. (2002). “Approximation and Collusion in Multicast Cost Sharing,” submitted. http://www.cs.yale.edu/homes/jf/AFKSS.ps
Dutta, B. and Ray, D. (1989). “A concept of egalitarianism under participation constraints,” Econometrica 57, pp. 615–635.
Feigenbaum, J., Krishnamurthy, A., Sami, R., and Shenker, S. (2002). “Hardness Results for Multicast Cost Sharing,” submitted. http://www.cs.yale.edu/homes/jf/FKSS2.ps.
Feigenbaum, J., Papadimitriou, C., and Shenker, S. (2001). “Sharing the cost of multicast transmissions,” Journal of Computer and System Sciences 63, pp. 21–41.
Feigenbaum, J. and Shenker, S. (2002). “Distributed Algorithmic Mechanism Design: Recent Results and Future Directions,” in Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 1–13, ACM Press, New York.
Fiat, A., Goldberg, A., Hartline, J., and Karlin, A. (2002). “Competitive Generalized Auctions,” in Proceedings of the 34th Symposium on the Theory of Computing, pp. 72–81, ACM Press, New York.
Green, J. and Laffont, J-J. (1979). Incentives in Public Decision Making, North Holland, Amsterdam.
Herzog, S., Shenker, S., and Estrin, D. (1997). “Sharing the ‘cost’ of multicast trees: An axiomatic analysis,” IEEE/ACM Transactions on Networking 5, pp. 847–860.
Jackson, M. (2001). “A Crash Course in Implementation Theory,” Social Choice and Welfare 18, pp. 655–708.
Jain, K. and Vazirani, V. (2001). “Applications of approximation to cooperative games,” in Proceedings of the 33rd Symposium on the Theory of Computing, pp. 364–372, ACM Press, New York.
Kushilevitz, E. and Nisan, N. (1997). Communication Complexity, Cambridge University Press, Cambridge.
Moulin, H. (1999). “Incremental cost sharing: characterization by strategyproofness,” Social Choice and Welfare 16, pp. 279–320.
Moulin, H. and Shenker, S. (2001). “Strategyproof Sharing of Submodular Costs: Budget Balance Versus Efficiency,” Economic Theory 18, pp. 511–533.
Mitchell, J. and Teague, V. (2002). Private communication.
Nisan, N. and Ronen, A. (2000). “Computationally feasible VCG mechanisms,” in Proceedings of the 2nd Conference on Electronic Commerce (EC-00), pp. 242–252, ACM Press, New York.
Nisan, N. and Ronen, A. (2001). “Algorithmic mechanism design,” Games and Economic Behavior 35, pp. 166–196.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S. (2002). Hardness Results for Multicast Cost Sharing. In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_13
Download citation
DOI: https://doi.org/10.1007/3-540-36206-1_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00225-3
Online ISBN: 978-3-540-36206-7
eBook Packages: Springer Book Archive