Intervention with Complete and Incomplete Information: Application to Flow Control

被引:2
作者
Canzian, Luca [1 ]
Xiao, Yuanzhang [1 ]
Zame, William [2 ]
Zorzi, Michele [3 ]
van der Schaar, Mihaela [1 ]
机构
[1] Univ Calif Los Angeles, Dept Elect Engn, Los Angeles, CA 90095 USA
[2] Univ Calif Los Angeles, Dept Econ, Los Angeles, CA 90095 USA
[3] Univ Padua, Dept Informat Engn, I-35131 Padua, Italy
基金
美国国家科学基金会;
关键词
Flow control; congestion control; game theory; intervention; mechanism design; incomplete information; INCENTIVE COMPATIBILITY; NETWORKS; GAMES; TELECOMMUNICATIONS; CONVERGENCE;
D O I
10.1109/TCOMM.2013.061013.120559
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Most congestion control schemes are based on user cooperation, i.e., they implicitly assume that users are willing to share their private information and to take actions such that the network operates efficiently. However, a self-interested and strategic user might exploit such schemes to obtain an individual gain at the expenses of the other users, misrepresenting its private information and overusing the resources. We first quantify the inefficiency of the network in the presence of selfish users for two different scenario: in the complete information case - in which the users have no private information - and in the incomplete information case - in which the users have private information. Then, we ask whether the congestion control scheme can be designed to be robust to self-interested strategic users. To reach this objective, we use an intervention scheme. For the complete information scenario we describe a scheme that is able to give the users an incentive to optimally use the resources. For the incomplete information scenario we describe two schemes that provide the users with an incentive to report truthfully and to use the resources efficiently, although not always optimally. Illustrative results show that the considered schemes can considerably improve the efficiency of the network.
引用
收藏
页码:3206 / 3218
页数:13
相关论文
共 33 条
[1]  
Alpcan T., 2003, Annals of Dynamic Games, V7
[2]   Nash equilibria for combined flow control and routing in networks: Asymptotic behavior for a large number of users [J].
Altman, E ;
Basar, T ;
Srikant, R .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2002, 47 (06) :917-930
[3]   A survey on networking games in telecommunications [J].
Altman, E ;
Boulogne, T ;
El-Azouzi, R ;
Jiménez, T ;
Wynter, L .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (02) :286-311
[4]   Competitive routing in networks with polynomial costs [J].
Altman, E ;
Basar, T ;
Jiménez, T ;
Shimkin, N .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2002, 47 (01) :92-96
[5]  
[Anonymous], 1972, Decision and Organization
[6]  
[Anonymous], TECHNICAL REPORT
[7]  
[Anonymous], 2006, GAME THEORY WIRELESS
[8]  
Basar T., P 2002 IEEE INFOCOM, P23
[9]  
Canzian L., 2013, IEEE T COMM IN PRESS
[10]   STRATEGIC INFORMATION-TRANSMISSION [J].
CRAWFORD, VP ;
SOBEL, J .
ECONOMETRICA, 1982, 50 (06) :1431-1451