Approximation and collusion in multicast cost sharing

Games and Economic Behavior

Volumn 47, Issue 1, 2004, Pages 36-71

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

^a Department of Obstetrics Gynecology   (United States)

^b YALE UNIVERSITY   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1842502056     PISSN: 08998256     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0899-8256(03)00176-3     Document Type: Article

References (34)

1. Adler, M., Rubenstein, D., 2002. Pricing multicast in more practical network models. In: Proceedings of the 13th Symposium on Discrete Algorithms. ACM/SIAM, New York/Philadelphia, pp. 981-990.
2. Archer, A., Tardos, E., 2002. Frugal path mechanisms. In: Proceedings of 13th Symposium on Discrete Algorithms. ACM/SIAM, New York/Philadelphia, pp. 991-999.
3. Ballardie, A., Francis, P., Crowcroft, J., 1993. Core based trees (CBT). In: Proceedings of Sigcomm 1993. ACM, New York, pp. 85-95.
4. Clarke, E.H., 1971. Multipart pricing of public goods. Public Choice 1971, 17-33.
5. Deering, S., Cheriton, D., 1990. Multicast routing in datagram internetworks and extended LANs. ACM Trans. Comput. Syst. 8, 85-110.
6. Deering, S., Estrin, D., Farinacci, D., Jacobson, V., Liu, C., Wei, L., 1996. The PIM architecture for wide-area multicast routing. ACM/IEEE Trans. Networking 4, 153-162.
7. Feigenbaum, J., Krishnamurthy, A., Sami, R., Shenker, S., 2003. Hardness results for multicast cost sharing. Theoret. Comput. Sci. 304, 215-236.
8. Feigenbaum, J., Papadimitriou, C., Shenker, S., 2001. Sharing the cost of multicast transmissions. J. Comput. System Sci. 63, 21-41. Special issue on Internet Algorithms.
9. Feigenbaum, J., 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. ACM, New York, pp. 1-13.
10. Fiat, A., Goldberg, A., Hartline, J., Karlin, A., 2002. Generalized competitive auctions. In: Proceedings of the 34th Symposium on Theory of Computing. ACM, New York, pp. 72-81.
11. Goldberg, A., Hartline, J., Wright, A., 2001. Competitive auctions and digital goods. In: Proceedings of 12th Symposium on Discrete Algorithms. ACM/SIAM, New York/Philadelphia, pp. 735-744.
12. Green, J., Laffont, J.-J., 1979. Incentives in Public Decision Making. North-Holland, Amsterdam.
13. Groves, T., 1973. Incentives in teams. Econometrica 41, 617-631.
14. Hershberger, J., Suri, S., 2001. Vickrey prices and shortest paths: What is an edge worth? In: Proceedings of the 42nd Symposium on the Foundations of Computer Science. IEEE, Los Alamitos, pp. 129-140.
15. Holbrook, H., Cheriton, D., 1999. IP multicast channels: EXPRESS support for large-scale single-source applications. In: Proceedings of Sigcomm '99. ACM, New York, pp. 65-78.
16. Herzog, S., Shenker, S., Estrin, D., 1997. Sharing the 'cost' of multicast trees: An axiomatic analysis. ACM/IEEE Trans. Networking 5, 847-860.
17. Jain, K., Vazirani, V., 2001. Applications of approximation to cooperative games. In: Proceedings of 33rd Symposium on the Theory of Computing. ACM, New York, pp. 364-372.
18. Lavi, R., Nisan, N., 2000. Competitive analysis of incentive compatible on-line auctions. In: Proceedings of 2nd Conference on Electronic Commerce (EC-00). ACM, New York, pp. 233-241.
19. Mas-Colell, A., Whinston, M., Green, J., 1995. Microeconomic Theory. Oxford Univ. Press, New York.
20. Megiddo, N., 1978. Computational complexity of the game theory approach to cost allocation for a tree. Math. Operations Res. 3, 189-196.
21. Mitchell, J., Teague, V., 2002. Private communication.
22. Monderer, D., Tennenholtz, M., 1999. Distributed games: From mechanisms to protocols. In: Proceedings of 16-th National Conference on Artificial Intelligence (AAAI 1999). AAAI Press, Menlo Park, CA, pp. 32-37.
23. Moulin, H., 1999. Incremental cost sharing: Characterization by strategyproofness. Soc. Choice Welfare 16, 279-320.
24. Moulin, H., Shenker, S., 2001. Strategyproof sharing of submodular costs: Budget balance versus efficiency. Econ. Theory 18, 511-533.
25. Nisan, N., Ronen, A., 2000. Computationally feasible VCG mechanisms. In: Proceedings of 2nd Conference on Electronic Commerce (EC-00). ACM, New York, pp. 242-252.
26. Nisan, N., Ronen, A., 2001. Algorithmic mechanism design. Games Econ. Behav. 35, 166-196.
27. Parkes, D., 1999. iBundle: An efficient ascending price bundle auction. In: Proceedings of 1st Conference on Electronic Commerce (EC-99). ACM, New York, pp. 148-157.
28. Parkes, D., Ungar, L., 2000. Iterative combinatorial auctions: Theory and practice. In: Proceedings of 17th National Conference on Artificial Intelligence (AAAI 2000). AAAI Press, Menlo Park, CA, pp. 74-81.
29. Perlman, R., Lee, C.-Y., Ballardie, A., Crowcroft., J., Wang, Z., Maufer, T., Diot, C., Green, M., 1999. Simple multicast: A design for simple low-overhead multicast. IETF internet draft. In preparation.
30. Roughgarden, T., Tardos, E., 2002. How bad is selfish routing? J. ACM 49, 236-259.
31. Sandholm, T., 1999. Distributed rational decision making. In: Weiss, G. (Ed.), Multiagent systems: A Modern Introduction to Distributed Artificial Intelligence. MIT Press, Cambridge, MA, pp. 201-258.
32. Vickrey, W., 1961. Counterspeculation, auctions and competitive sealed tenders. J. Finance 1961, 8-37.
33. Wellman, M., 1993. A market-oriented programming environment and its applications to distributed multicommodity flow problems. J. AI Res 1, 1-23.
34. Wellman, M., Walsh, W., Wurman, P., Mackie-Mason, J., 2001. Auction protocols for decentralized scheduling. Games Econ. Behav. 35, 271-303.