[1]
|
B. Edelman, M. Ostrovsky, M. Schwarz, T. D. Fudenberg, L. Kaplow, R. Lee, P. Milgrom, M. Niederle, and A. Pakes, “Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords”, American Economic Review, Vol. 97, 2005.
|
[2]
|
J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, “A BGP-based mechanism for lowest-cost routing”, Proceedings of the twenty-?rst annual symposium on Principles of distributed computing, 2002, pp. 173–182.
|
[3]
|
M. Feldman, J. Chuang, I. Stoica, and S. Shenker, “Hidden-action in multi-hop routing”, Pro-ceedings of the 6th ACM conference on Electronic com-merce, EC ’05, 2005, pp. 117–126.
|
[4]
|
D. Karger and E. Nikolova, “On the expected VCG overpayment in large networks”, Proceedings of45th IEEE Conference on Decision and Control, December 2006, pp. 2831–2836.
|
[5]
|
X.-Y. Li, Y. Wu, P. Xu, G. Chen, and M. Li, “Hidden information and actions in multi-hop wireless ad hoc networks”, Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, MobiHoc ’08, 2008, pp. 283–292.
|
[6]
|
H. Liu and B. Krishnamachari, “A price-based reliable routing game in wireless networks”, Proceedings of the 2006 workshop on Game theory for communications and networks, GameNets ’06, 2006.
|
[7]
|
M. Osborne and A. Rubinstein, “A course in game theory”, The MIT Press, 1994.
|
[8]
|
X. Su, S. Chan, and G. Peng, “Auction in multi-path multi-hop routing”, IEEE Communications Letters, Vol. 13, No. 2, 2009, pp.154–156.
|
[9]
|
X. Su, S. Chan, and G. Peng, “Genera-lized second price auction in multi-path routing with selfish nodes”, Proceedings of the IEEE GLOBECOM, 2009, pp. 3413–3418.
|
[10]
|
K. Talwar, “The price of truth: Frugality in truthful mechanisms”, Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, 2003, pp. 608–619.
|
[11]
|
H. R. Varian, “Position auctions”,International Journal of Industrial Organization, Vol. 25, No. 6, 2007, pp. 1163–1178.
|
[12]
|
W. Wang, S. Eidenbenz, Y. Wang, and X.-Y. Li, “OURS: optimal unicast routing systems in non-cooperative wireless networks”, Proceedings of the 12th annual international conference on Mobile computing and networking, MobiCom ’06, 2006, pp. 402–413.
|
[13]
|
W. Wang and X.-Y. Li, “Low-cost routing in selfish and rational wireless ad hoc networks”, IEEE Transactions on Mobile Computing, Vol. 5, May 2006, pp. 596–607.
|
[14]
|
W. Wang, X.-Y. Li, and X. Chu, “Nash equilibria and dominant strategies in routing”, Proceedings of the First international conference on Internet and Network Economics, WINE’05, 2005, pp. 979– 988.
|
[15]
|
F. Wu, T. Chen, S. Zhong, L. E. Li, and Y. R. Yang, “Incentive-compatible opportunistic routing for wireless networks”, Pro?ceedings of the 14th ACM international conference on Mobile computing and net-working, MobiCom ’08, 2008, pp. 303–314.
|
[16]
|
Y. Wu, S. Tang, P. Xu, and X.-Y. Li, “Dealing with selfishness and moral hazard in non-cooperative wireless networks”, IEEE Trans. on Mobile Computing, Vol. 9, No. 3, March 2010, pp. 420–434.
|
[17]
|
S. Zhong, J. Chen, and Y. Yang, “Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks”, Pro?ceedings of theINFOCOM 2003, 2003, pp. 1987–1997.
|
[18]
|
S. Zhong, L. Li, Y. Liu, and Y. Yang, “On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretic and cryptographic techniques”, Wireless Networks, Vol. 13, No. 6, 2007, pp. 799–816.
|