Auction in Multi-Path Multi-Hop Routing

被引：14
作者：
Su, Xueyuan [1 ]
Chan, Sammy [2 ]
Peng, Gang [2 ]
机构：
[1] Yale Univ, Dept Comp Sci, New Haven, CT 06520 USA
[2] City Univ Hong Kong, Dept Elect Engn, Hong Kong, Hong Kong, Peoples R China
来源：
IEEE COMMUNICATIONS LETTERS | 2009年 / 13卷 / 02期
关键词：
Mechanism design; game theory; Nash equilibrium;
D O I：
10.1109/LCOMM.2009.082021
中图分类号：
TN [电子技术、通信技术];
学科分类号：
0809 ;
摘要：
We model the multi-path multi-hop routing in networks with selfish nodes as an auction and provide a novel solution from the game-theoretical perspective. We design a mechanism that results in Nash equilibria rather than the traditional strategy proofness, which alleviates the over-payment problem of the widely used VCG mechanism. Through theoretical analysis, the proposed protocol is shown to be effective.
引用
收藏
页码：154 / 156
页数：3
相关论文
共 11 条
[1]  
Anderegg L., 2003, Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, P245, DOI DOI 10.1145/938985.939011
[2]   Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords [J].
Edelman, Benjamin ;
Ostrovsky, Michael ;
Schwarz, Michael .
AMERICAN ECONOMIC REVIEW, 2007, 97 (01) :242-259
[3]  
Feigenbaum Joan., 2002, P 21 ANN S PRINCIPLE, P173
[4]  
KARGER DR, 2006, P 45 IEEE C DEC CONT
[5]  
Mas-Colell A, 1995, MICROECONOMIC THEORY, V1
[6]  
Osborne Martin J, 1994, A Course in Game Theory
[7]  
Talwar K, 2003, LECT NOTES COMPUT SC, V2607, P608
[8]  
VARIAN HR, 2006, INT J IND ORG OCT
[9]  
WANG W, 2006, P ACM MOBICOM, P402
[10]  
Wu F, 2007, GLOB TELECOMM CONF, P453
12