Congestion Game With Agent and Resource Failures

Motivated by practical scenarios, we study congestion games with failures. We investigate two models. The first model is congestion games with both resource and agent failures, where each agent chooses the same number of resources with the minimum expected cost. We prove that the game is potential and hence admits at least one pure-strategy Nash equilibrium (pure-NE). We also show that the Price of Anarchy and the Price of Stability are bounded (equal to 1 in some cases). The second model is congestion games with only resource failures (CG-CRF), where resources are provided in packages, and their failures can be correlated with each other. Each agent can choose multiple packages for reliability’s sake and utilize the survived one having the minimum cost. CG-CRF is shown to be not potential. We prove that it admits at least one pure-NE by constructing one efficiently. Finally, we discuss various applications of these two games in the networking field. To the best of our knowledge, this is the first paper studying congestion games with the coexistence of resource and agent failures, and we give also the first proof of the existence of a pure-NE in congestion games with correlated package failures.

[1]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[2]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[3]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[4]  Tony Q. S. Quek,et al.  Congestion games in caching enabled heterogeneous cellular networks , 2015, 2015 IFIP Networking Conference (IFIP Networking).

[5]  Rahul Savani,et al.  Cooperative max games and agent failures , 2014, AAMAS.

[6]  Jason R. Marden,et al.  Joint Strategy Fictitious Play with Inertia for Potential Games , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[7]  L. Shapley,et al.  Potential Games , 1994 .

[8]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[9]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

[10]  Nathan Linial,et al.  Game-theoretic aspects of computing , 1994 .

[11]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[12]  Moshe Tennenholtz,et al.  Solving Cooperative Reliability Games , 2011, UAI.

[13]  Guihai Chen,et al.  Dynamic virtual machine management via approximate Markov decision process , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[14]  Francis C. M. Lau,et al.  Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model , 2012, SIROCCO.

[15]  Moshe Tennenholtz,et al.  Mechanism Design with Execution Uncertainty , 2002, UAI.

[16]  Yongcai Wang,et al.  Selfish task-driven routing in hybrid networks , 2015, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[17]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[18]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[19]  Jianzhong Li,et al.  Distributed Data Aggregation Scheduling in Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[20]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2003, TNET.

[21]  Ian F. Akyildiz,et al.  NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey , 2006, Comput. Networks.

[22]  Moshe Tennenholtz,et al.  Congestion Games with Agent Failures , 2012, AAAI.

[23]  Quanyan Zhu,et al.  Interference Aware Routing Game for Cognitive Radio Multi-Hop Networks , 2012, IEEE Journal on Selected Areas in Communications.

[24]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[25]  Mung Chiang,et al.  RAT selection games in HetNets , 2013, 2013 Proceedings IEEE INFOCOM.

[26]  Georgia Perakis,et al.  The Price of Anarchy in Supply Chains: Quantifying the Efficiency of Price-Only Contracts , 2007, Manag. Sci..

[27]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[28]  Michael J. Franklin,et al.  Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing , 2012, NSDI.

[29]  Csaba D. Tóth,et al.  Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.

[30]  Osvaldo Simeone,et al.  Dynamic Compression-Transmission for Energy-Harvesting Multihop Networks With Correlated Sources , 2012, IEEE/ACM Transactions on Networking.

[31]  Maria-Florina Balcan,et al.  The price of uncertainty , 2009, EC '09.

[32]  Itai Ashlagi,et al.  Learning Equilibrium in Resource Selection Games , 2007, AAAI.

[33]  Stefan Savage,et al.  California fault lines: understanding the causes and impact of network failures , 2010, SIGCOMM '10.

[34]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[35]  Ramesh Govindan,et al.  Evolve or Die: High-Availability Design Principles Drawn from Googles Network Infrastructure , 2016, SIGCOMM.

[36]  M. Messner,et al.  Robust Political Equilibria Under Plurality and Runoff Rule , 2005 .

[37]  Mingyan Liu,et al.  Atomic Congestion Games on Graphs and Their Applications in Networking , 2012, IEEE/ACM Transactions on Networking.

[38]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[39]  Pascal Billand,et al.  Nash Networks with Imperfect Reliability and Heterogeous Players , 2011, IGTR.

[40]  Moshe Tennenholtz,et al.  Congestion games with failures , 2005, EC '05.

[41]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1976, STOC '76.

[42]  Xin Wu,et al.  zUpdate: updating data center networks with zero loss , 2013, SIGCOMM.

[43]  Moshe Tennenholtz,et al.  Congestion games with load-dependent failures: identical resources , 2007, EC '07.

[44]  Xu Chen,et al.  Quality of Service Games for Spectrum Sharing , 2013, IEEE Journal on Selected Areas in Communications.

[45]  Yoram Bachrach,et al.  Reliability Weighted Voting Games , 2013, SAGT.

[46]  Sanjeev Goyal,et al.  A Noncooperative Model of Network Formation , 2000 .