Network Games, Control, and Optimization: Proceedings of NETGCOOP 2016, Avignon, France

Preface......Page 6
Contents......Page 8
Program Committee......Page 10
Additional Reviewers......Page 12
Author Index......Page 13
 1 Introduction......Page 15
 2 Stochastic Game Model and Statement of the Problem......Page 16
  2.1 Markov Game Formulation......Page 17
  2.2 Computing the Equilibrium......Page 18
 3 Example of Non-Uniqueness of the Equilibrium......Page 19
 4 Iterative Method......Page 20
 5 Concluding Comments......Page 23
 References......Page 24
Dynamic Games for Analyzing Competition in the Internet and in On-Line Social Networks......Page 25
 1 Introduction......Page 26
 2 Timing Game in Social Networks: When to Post Content......Page 27
 3 Stochastic Evolutionary Games......Page 32
 4 Epidemic Games for Cyber-Security and Content Diffusion......Page 33
 References......Page 34
Load Balancing Congestion Games and Their Asymptotic Behavior......Page 37
 1 Introduction......Page 38
 2 Model and Notations......Page 39
 3 Atomic Non-Splitable Case and Its Non-Atomic Limit (F3 Framework)......Page 40
  3.2 The Potential and Asymptotic Uniqueness......Page 41
  3.3 Efficiency......Page 42
  4.1 Efficiency......Page 43
  4.2 Case N=1......Page 44
  4.5 Case a-2b>0......Page 45
 5 Conclusions......Page 46
 References......Page 47
 1 Introduction......Page 48
 2 Related Work......Page 49
 3 Building the Internet Backbone Graph......Page 50
 4 Studying the Robustness of the Internet Backbone......Page 51
 5 The Go-Index: If You Cannot See Google, You Are Not Connected......Page 53
 References......Page 55
  1.1 K-User Centralized Gaussian Multiple Access Channel......Page 58
  1.2 Achievable Rates and Capacity Region......Page 59
  1.3 K-User Decentralized Gaussian Multiple Access Channel......Page 60
 2 Game I: Only the Transmitters Are Players......Page 61
  2.1 η-NE Region with Single User Decoding (SUD)......Page 62
  2.3 η-NE Region with Time-Sharing (TS)......Page 63
 3 Game II: A Sequential Game......Page 64
  3.1 η-Sequential Equilibrium Region with the Receiveras Leader......Page 65
 4 Example and Observations......Page 66
 References......Page 67
Correlated Equilibria in Wireless Power Control Games......Page 69
 2 System Model......Page 70
  3.1 Power Control Games Using a Correlated Device......Page 72
  3.2 Communication Equilibrium in Power Control Games......Page 73
  4.1 Linear Programming Method......Page 74
  4.2 Regret Matching Procedure......Page 77
 5 Numerical Results and Analysis......Page 78
 References......Page 79
 1 Introduction......Page 81
 2 Related Work......Page 82
 3 Network Model......Page 83
  3.2 Fractional EE Utility Functions......Page 84
  3.3 Price of Malice......Page 85
  4.1 NE in the Presence of Malicious Devices......Page 86
 5 Numerical Analysis......Page 88
 6 Summary......Page 89
 References......Page 90
 1 Introduction......Page 91
 2 Optimal Policy for a Single Bottleneck......Page 92
  3.1 Multiple Bottleneck Model......Page 95
  3.2 Asymptotic Optimality of the Water-Filling Algorithm......Page 96
 4 Water-Filling Algorithm Implementation......Page 98
 5 Conclusions......Page 99
 References......Page 100
 1 Introduction......Page 101
 2 System Model......Page 102
 3 Game Model......Page 104
  3.1 Nash Equilibrium......Page 106
  3.2 Calculation of the Nash Equilibrium......Page 107
  3.3 Interior Nash with Linear Costs......Page 108
 4 Numerical Results......Page 109
 5 Conclusions and Discussion......Page 110
 References......Page 111
 1 Introduction and Motivation......Page 112
 2 System Model......Page 114
 3 Analysis......Page 115
 4 Analysis for N=2 Operators......Page 117
 5 Performance Evaluation......Page 118
 6 Conclusions......Page 120
 References......Page 121
 1 Introduction......Page 123
 2 The Competitive Aggregative Game......Page 125
 3 Fixed Points of the Aggregation Mapping......Page 126
 4 Incentive Mechanism as Picard–Banach Iteration......Page 127
 5 Global Convergence via Semi-Decentralized Iterations......Page 128
 References......Page 130
Multi-Games for LTE and WiFi Coexistence over Unlicensed Channels......Page 133
 1 Introduction......Page 134
 2 System Model......Page 135
  3.1 Followers\' Game......Page 136
  3.2 Leaders\' Game......Page 139
   3.2.1 Proposed Algorithm......Page 141
 References......Page 142
 1 Introduction......Page 144
 2 System Model......Page 145
 3 Optimization Problem......Page 146
 4 Decentralized Solution......Page 148
 5 Distributed Algorithm for BS Selection......Page 149
 6 Simulation Results......Page 151
 References......Page 154
 1 Introduction......Page 155
 3 Problem Statement......Page 157
 4 ILP Formulation......Page 159
  4.1 ILP for SS-PC......Page 160
  4.2 ILP for SS-PC\'......Page 161
 5 Performance Evaluation......Page 162
 References......Page 164
 1 Introduction......Page 166
  1.1 Outline......Page 167
 2 System Model......Page 168
 3 Learning Algorithm to Find a Correlated Equilibrium......Page 169
 5 A Numerical Example......Page 172
 References......Page 173
 1 Introduction......Page 175
 2 Model......Page 176
 3 Existence of Nash Equilibrium and Algorithm......Page 177
  3.1 Algorithm......Page 178
 4 Numerical Illustrations......Page 179
  4.2 Healthy Carrier Game......Page 180
  4.3 Sustainable Game......Page 181
 References......Page 182
Interference Mitigation via Pricing in Time-Varying Cognitive Radio Systems......Page 183
 1 Introduction......Page 184
 2 System Model and Problem Formulation......Page 185
 3 Exponential Learning......Page 187
 4 Numerical Results......Page 189
 5 Conclusions and Perspectives......Page 191
 References......Page 192
 1 Introduction......Page 193
 2 Model and Definitions......Page 194
  3.1 Dynamical Systems Without Transient States......Page 197
  3.2 Dynamical Systems with Transient States......Page 198
 4 Illustrative Example......Page 202
 References......Page 204
 1 Introduction......Page 205
 2 Mathematical Model......Page 207
 3 Structure of Optimal Control......Page 208
 4 Impulse Control Problem......Page 210
  4.1 Structure of the Control......Page 211
 5 Numerical Simulations......Page 212
 6 Conclusion......Page 213
 References......Page 215
An Experimental Comparison of Routing and Spectrum Assignment Algorithms in Elastic Optical Networks......Page 216
 1 Introduction......Page 217
 2 The Architecture of EONs......Page 218
  3.1 Route-First RSA......Page 220
 4 Performances Comparison Under Different Distributions......Page 221
  4.1 Comparisons in Uniform Distribution......Page 222
  4.2 Comparisons in Concentrated Distribution......Page 223
 5 Conclusion......Page 224
 References......Page 225
 1 Introduction......Page 227
 2 System Model......Page 228
  3.1 Basic Power Modulation Scheme......Page 230
  3.2 An Adaptive Modulation Scheme with Local CSI Perfectly Known......Page 231
  3.3 An Adapted Modulation Scheme with Noisy Local CSI......Page 233
 4 Numerical Analysis......Page 234
 References......Page 236