Adversarial Behavior in Network Games

被引:0
作者
Anil Kumar Chorppath
Tansu Alpcan
Holger Boche
机构
[1] Technical University of Munich,
[2] The University of Melbourne,undefined
来源
Dynamic Games and Applications | 2015年 / 5卷
关键词
Adversarial behavior; Mechanism design; Game theory; Detection and counter measures; Collusion; Interference management;
D O I
暂无
中图分类号
学科分类号
摘要
This paper studies the effects of and countermeasures against adversarial behavior in network resource allocation mechanisms such as auctions and pricing schemes. It models the heterogeneous behavior of users, which ranges from altruistic to selfish and to malicious, within the analytical framework of game theory. A mechanism design approach is adopted to quantify the effect of adversarial behavior, which ranges from extreme selfishness to destructive maliciousness. First, the well-known result on the Vicrey–Clarke–Groves (VCG) mechanism losing its efficiency property in the presence of malicious users is extended to the case of divisible resource allocation to motivate the need to quantify the effect of malicious behavior. Then, the Price of Malice of the VCG mechanism and of some other network mechanisms are derived. In this context, the dynamics and convergence properties of an iterative distributed pricing algorithm are analyzed. The resistance of a mechanism to collusions is investigated next, and the effect of collusion of some malicious users is quantified. Subsequently, the assumption that the malicious user has information about the utility function of selfish users is relaxed, and a regression-based iterative learning scheme is presented and applied to both pricing and auction mechanisms. Differentiated pricing as a method to counter adversarial behaviors is proposed and briefly discussed. The results obtained are illustrated with numerical examples and simulations.
引用
收藏
页码:26 / 64
页数:38
相关论文
共 24 条
[1]  
Alpcan T(2005)A utility-based congestion control scheme for internet-style networks with delay IEEE Trans Netw 13 1261-1274
[2]  
Başar T(2007)A jamming game in wireless networks with transmission cost Lect Notes Comput Sci 4465 1-12
[3]  
Avrachenkov K(2011)A convex optimization framework for almost budget balanced allocation of a divisible good IEEE Trans Autom Sci Eng 8 520-531
[4]  
Altman E(1967)Games with incomplete information played by ‘Bayesian’ players Manag Sci Theory Ser 14 159-182
[5]  
Garnaev A(2005)Efficiency loss in a network resource allocation game: the case of elastic supply IEEE Trans Autom Control 50 1712-1724
[6]  
Chorppath AK(1998)Rate control in communication networks: shadow prices, proportional fairness and stability J Oper Res Soc 49 237-252
[7]  
Bhashyam S(1999)Worst-case equilibria Lect Notes Comput Sci 1563 404-413
[8]  
Sundaresan R(2001)Strategyproof sharing of submodular costs: budget balance versus efficiency J Econ Theory 18 511-533
[9]  
Harsanyi JC(1965)Existence and uniqueness of equilibrium points for concave N-person games Econometrica 33 520-534
[10]  
Johari R(2003)The spite motive and equilibrium behavior in auctions Contrib Econ Anal Policy 2 1102-1127