
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Zongpeng Li, Xiaowen Chu, "On Achieving GroupStrategyproof Multicast," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 5, pp. 913923, May, 2012.  
BibTex  x  
@article{ 10.1109/TPDS.2011.197, author = {Zongpeng Li and Xiaowen Chu}, title = {On Achieving GroupStrategyproof Multicast}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {23}, number = {5}, issn = {10459219}, year = {2012}, pages = {913923}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.197}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  On Achieving GroupStrategyproof Multicast IS  5 SN  10459219 SP913 EP923 EPD  913923 A1  Zongpeng Li, A1  Xiaowen Chu, PY  2012 KW  Multicast KW  network coding KW  game theory KW  mathematical programming/optimization. VL  23 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] J. Feigenbaum, C. Papadimitriou, and S. Shenker, "Sharing the Cost of Multicast Transmissions," J. Computer and System Sciences, vol. 63, pp. 2141, 2001.
[2] S. Chen, O. Günlük, and B. Yener, "The Multicast Packing Problem," IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 311318, June 2000.
[3] C. Chekuri, J. Chuzhoy, L. LewinEytan, J. Naor, and A. Orda, "NonCooperative Multicast and Facility Location Games," Proc. Seventh ACM Conf. Electronic Commerce (EC), 2006.
[4] M. Castro, P. Druschel, A.M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: HighBandwidth Multicast in Cooperative Environments," Proc. 19th ACM Symp. Operating Systems Principles (SOSP), Oct. 2003.
[5] Z. Li, B. Li, and L.C. Lau, "On Achieving Optimal Multicast Throughput in Undirected Networks," IEEE Trans. Information Theory, vol. 52, no. 6, pp. 24672485, June 2006.
[6] K. Jain, M. Mahdian, and M.R. Salavatipour, "Packing Steiner Trees," Proc. 14th Ann. ACMSIAM Symp. Discrete Algorithms (SODA), 2003.
[7] M. Thimm, "On the Approximability of the Steiner Tree Problem," Proc. 26th Int'l Math. Foundations of Computer Science, 2001.
[8] R. Ahlswede, N. Cai, S.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 12041216, July 2000.
[9] R. Koetter and M. Médard, "An Algebraic Approach to Network Coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782795, Oct. 2003.
[10] Z. Li, B. Li, D. Jiang, and L.C. Lau, "On Achieving Optimal Throughput with Network Coding," Proc. IEEE INFOCOM, 2005.
[11] Z. Li and B. Li, "Efficient and Distributed Computation of Maximum Multicast Rates," Proc. IEEE INFOCOM, 2005.
[12] D.S. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, and H. Lee, "Achieving MinimumCost Multicast: a Decentralized Approach Based on Network Coding," Proc. IEEE INFOCOM, 2005.
[13] Y. Wu, P.A. Chou, Q. Zhang, K. Jain, W. Zhu, and S.Y. Kung, "Network Planning in Wireless Ad Hoc Networks: A CrossLayer Approach," IEEE J. Selected Areas in Comm., vol. 23, no. 1, pp. 136150, Jan. 2005.
[14] J. Yuan, Z. Li, W. Yu, and B. Li, "A CrossLayer Optimization Framework for Multihop Multicast in Wireless Mesh Networks," IEEE J. Selected Areas in Comm., vol. 24, no. 11, pp. 20922103, Nov. 2006.
[15] C. Papadimitriou, "Algorithms, Games, and the Internet," Proc. 33rd Ann. ACM Symp. Theory of Computing (STOC), 2001.
[16] W. Wang, X.Y. Li, and Y. Wang, "Truthful Multicast in Selfish Wireless Networks," Proc. ACM MobiCom, 2004.
[17] W. Wang, X.Y. Li, and Z. Sun, "Sharing the Multicast Payment Fairly," Proc. 11th Ann. Int'l Computing and Combinatorics Conf. (COCOON), 2005.
[18] Z. Li, "MinCost Multicast of Selfish Information Flows," Proc. IEEE INFOCOM, 2007.
[19] H. Moulin and S. Shenker, "Strategyproof Sharing of Submodular Costs: Budget Balance versus Efficiency," Economic Theory, vol. 18, no. 3, pp. 511533, 2001.
[20] M. Pál and E. Tardos, "Group Strategyproof Mechanisms via PrimalDual Algorithms," Proc. IEEE 44th Ann. Symp. Foundations of Computer Science (FOCS), 2003.
[21] H. Moulin, Game Theory for the Social Sciences. New York Univ. Press, 1982.
[22] K. Jain and V.V. Vazirani, "Applications of Approximation Algorithms to Cooperative Games," Proc. 33rd Ann. ACM Symp. Theory of Computing (STOC), 2001.
[23] H. Moulin, Cooperative Microeconomics: A Game Theoretic Introduction. Princeton Univ. Press, 1982.
[24] N. Immorlica, M. Mahdian, and V.S. Mirrokni, "Limitations of CrossMonotonic Cost Sharing Schemes," Proc. 16th Ann. ACMSIAM Symp. Discrete Algorithms (SODA), 2005.
[25] J. Könemann, S. Leonardi, and G. Schäfer, "A GroupStrategyproof Mechanism for Steiner Forests," Proc. 16th Ann. ACMSIAM Symp. Discrete Algorithms (SODA), 2005.
[26] P. Erdös and A. Rënyi, "On the Existence of a Factor of Degree One of a Connected Random Graph," Acta Mathematica Hungarica, vol. 17, nos. 3/4, pp. 359368, 1966.
[27] H. Moulin, "Dominance Solvability and Cournot Stability," Math. Social Sciences, vol. 7, pp. 83102, 1984.
[28] L.S. Shapley, "A Value for $n$ Person Games," Contributions to the Theory of Games, Princeton Univ. Press, pp. 3140, 1953.
[29] D.B. West, Introduction to Graph Theory, second ed. Prentice Hall, 2001.
[30] A. Gopinathan, Z. Li, and B. Li, "On Achieving Group Strategyproof Information Dissemination in Wireless Networks," Proc. First Int'l Conf. Game Theory for Networks (GameNets), 2009.
[31] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
[32] D.P. Bertsekas, Network Optimization: Continuous and Discrete Models. Athena Scientific, 1998.
[33] Z. Li, B. Li, and L.C. Lau, "A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks," IEEE Trans. Information Theory, vol. 55, no. 3, pp. 10161026, Mar. 2009.
[34] A. Agarwal and M. Charikar, "On the Advantage of Network Coding for Improving Network Throughput," Proc. IEEE Information Theory Workshop, 2004.
[35] GNU Linear Programming Kit, http://www.gnu.org/software/glpkglpk.html , 2011.
[36] A. Medina, A. Lakhina, I. Matta, and J. Byers, BRITE: Boston Univ. Representative Internet Topology Generator, http://www.cs.bu.edubrite, 2011.