Hardness results for multicast cost sharing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2556 LNCS, Issue , 2002, Pages 133-144

  Feigenbaum, Joan ^a   Krishnamurthy, Arvind ^a   Sami, Rahul ^a   Shenker, Scott ^b  

^a YALE UNIVERSITY   (United States)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; COMPLEX NETWORKS; GAME THEORY; MACHINE DESIGN; MULTICASTING; SOFTWARE ENGINEERING;

BALANCED MECHANISM; COST SHARING; ECONOMIC MECHANISMS; HARDNESS RESULT; IMPOSSIBILITY RESULTS; LOWER BOUNDS; NETWORK COMPLEXITY; STRATEGY PROOFS;

COST EFFECTIVENESS;

EID: 84877785279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36206-1_13     Document Type: Conference Paper

References (17)

1. 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.
2. 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
3. Dutta, B. and Ray, D. (1989). "A concept of egalitarianism under participation constraints," Econometrica 57, pp. 615-635.
4. 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.
5. Feigenbaum, J., Papadimitriou, C., and Shenker, S. (2001). "Sharing the cost of multicast transmissions," Journal of Computer and System Sciences 63, pp. 21-41.
6. 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.
7. 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.
8. Green, J. and Laffont, J-J. (1979). Incentives in Public Decision Making, North Holland, Amsterdam.
9. 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.
10. Jackson, M. (2001). "A Crash Course in Implementation Theory," Social Choice and Welfare 18, pp. 655-708.
11. 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.
12. Kushilevitz, E. and Nisan, N. (1997). Communication Complexity, Cambridge University Press, Cambridge.
13. Moulin, H. (1999). "Incremental cost sharing: characterization by strategyproofness," Social Choice and Welfare 16, pp. 279-320.
14. Moulin, H. and Shenker, S. (2001). "Strategyproof Sharing of Submodular Costs: Budget Balance Versus Efficiency," Economic Theory 18, pp. 511-533.
15. Mitchell, J. and Teague, V. (2002). Private communication.
16. 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.
17. Nisan, N. and Ronen, A. (2001). "Algorithmic mechanism design," Games and Economic Behavior 35, pp. 166-196.