The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2011 vol.22)
pp: 708-715
Ajay Gopinathan , University of Calgary, Calgary
Zongpeng Li , University of Calgary, Calgary
Baochun Li , University of Toronto, Toronto
ABSTRACT
We study the dissemination of common information from a source to multiple nodes within a multihop wireless network, where nodes are equipped with uniform omnidirectional antennas and have a fixed cost per packet transmission. While many nodes may be interested in the dissemination service, their valuation or utility for such a service is usually private information. A desirable routing and charging mechanism encourages truthful utility reports from the nodes. We provide both negative and positive results toward such mechanism design. We show that in order to achieve the group strategyproof property, a compromise in routing optimality or budget-balance is inevitable. In particular, the fraction of optimal routing cost that can be recovered through node charges cannot be significantly higher than {1\over 2}. To answer the question whether constant-ratio cost recovery is possible, we further apply a primal-dual schema to simultaneously build a routing solution and a cost-sharing scheme, and prove that the resulting mechanism is group strategyproof and guarantees {1\over 4}-approximate cost recovery against an optimal routing scheme.
INDEX TERMS
Mechanism design, wireless networks, game theory, linear programming, approximation algorithms, theory.
CITATION
Ajay Gopinathan, Zongpeng Li, Baochun Li, "Group Strategyproof Multicast in Wireless Networks", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 5, pp. 708-715, May 2011, doi:10.1109/TPDS.2010.184
REFERENCES
[1] H. Moulin and S. Shenker, "Strategyproof Sharing of Submodular Costs: Budget Balance versus Efficiency," Economic Theory, vol. 18, pp. 511-533, 2001.
[2] H. Moulin, "Incremental Cost Sharing: Characterization by Coalition Strategy-Proofness," Social Choice and Welfare, vol. 16, pp. 279-320, 1999.
[3] Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, eds., Cambridge Univ. Press, 2007.
[4] N. Immorlica, M. Mahdian, and V.S. Mirrokni, "Limitations of Cross-Monotonic Cost Sharing Schemes," Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), 2005.
[5] K. Jain and V. Vazirani, "Applications of Approximation Algorithms to Cooperative Games," Proc. ACM Symp. Theory of Computing (STOC), 2001.
[6] M. Pal and E. Tardos, "Group Strategy Proof Mechanisms via Primal-Dual Algorithms," Proc. IEEE Symp. Foundations of Computer Science (FOCS), 2003.
[7] J. Konemann, S. Leonardi, and G. Schafer, "A Group-Strategyproof Mechanism for Steiner Forests," Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), 2005.
[8] Z. Li, "Cross-Monotonic Multicast," Proc. IEEE INFOCOM, 2008.
[9] M.X. Goemans and D.P. Williamson, "A General Approximation Technique for Constrained Forest Problems," Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), 1992.
[10] V.V. Vazirani, Approximation Algorithms. Springer-Verlag, 2001.
[11] L. Shapley, "A Value for N-Person Games," Contributions to the Theory of Games, pp. 31-40, Princeton Univ. Press, 1953.
[12] A. Gupta, A. Srinivasan, and E. Tardos, "Cost-Sharing Mechanisms for Network Design," Proc. Int'l Workshop Approximation Algorithms for Combinatorial Optimization (APPROX), 2004.
[13] A. Mehta, T. Roughgarden, and M. Sundararajan, "Beyond Moulin Mechanisms," Games and Economic Behavior, vol. 67, no. 1, pp. 125-155, 2009.
[14] J. Brenner and G. Schafer, "Cooperative Cost Sharing via Incremental Mechanisms," Preprint 650, DFG Research Center Matheon, Germany, 2009.
[15] R. Ahlswede, N. Cai, S.R. Li, and R.W. Yeung, "Network Information Flow," IEEE Trans. Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
[16] A. Gopinathan, Z. Li, and B. Li, "On Achieving Group Strategyproof Information Dissemination in Wireless Networks," Proc. Int'l Conf. Game Theory for Networks (GameNets), 2009.
[17] M. Thimm, "On the Approximability of the Steiner Tree Problem," Proc. 26th Int'l Symp. Math. Foundations of Computer Science, pp. 678-689, 2001.
[18] C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Dover Publications, 1998.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool