A mathematical tool for scientists and researchers who work with computer and communication networks, Game Theory in Communication Networks: Cooperative Resolution of Interactive Networking Scenarios addresses the question of how to promote cooperative behavior in interactive situations between heterogeneous entities in communication networking scenarios. It explores network design and management from a theoretical perspective, using game theory and graph theory to analyze strategic situations and demonstrate profitable behaviors of the cooperative entities.
The book promotes the use of Game Theory to address important resource management and security issues found in next generation communications networks, particularly heterogeneous networks, for cases where cooperative interactive networking scenarios can be formulated. It provides solutions for representative mechanisms that need improvement by presenting a theoretical step-by-step approach. The text begins with a presentation of theory that can be used to promote cooperation for the entities in a particular interactive situation. Next, it examines two-player interaction as well as interactions between multiple players. The final chapter presents and examines a performance evaluation framework based on MATLAB®.
Each chapter begins by introducing basic theory for dealing with a particular interactive situation and illustrating how particular aspects of game theory can be used to formulate and solve interactive situations that appear in communication networks regularly. The second part of each chapter presents example scenarios that demonstrate the applicability and power of the theoryillustrating a number of cooperative interactions and discussing how they could be addressed within the theoretical framework presented in the first part of the chapter.
The book also includes simulation code that can be downloaded so you can use some or all of the proposed models to improve your own network designs. Specific topics covered include network selection, user-network interaction, network synthesis, and context-aware security provisioning.
| Preface |
|
vii | |
|
1 Introduction: Game theory as an analytical tool |
|
|
1 | (14) |
|
|
|
6 | (9) |
|
2 Cooperation for two: Prisoner's Dilemma type of games |
|
|
15 | (38) |
|
|
|
15 | (1) |
|
2.2 Prisoner's Dilemma and similar two-player games |
|
|
16 | (4) |
|
2.3 Focusing on Prisoner's Dilemma |
|
|
20 | (3) |
|
2.3.1 Motivating cooperation from repetition |
|
|
21 | (1) |
|
|
|
22 | (1) |
|
2.4 Threats and punishments: The user as an active participant in the network |
|
|
23 | (30) |
|
2.4.1 An illustrative scenario |
|
|
23 | (3) |
|
2.4.2 Incentives, assumptions and requirements |
|
|
26 | (2) |
|
2.4.3 No past or future consideration: One-shot user-network interaction |
|
|
28 | (3) |
|
2.4.4 Considering past and future: Repeated user-network interaction |
|
|
31 | (9) |
|
2.4.5 The user as an adaptive entity |
|
|
40 | (4) |
|
2.4.6 Evaluating the game |
|
|
44 | (9) |
|
3 Cooperation for two: Dealing with different types of player behavior |
|
|
53 | (24) |
|
|
|
53 | (1) |
|
3.2 Cooperative behavior through bargaining |
|
|
54 | (1) |
|
3.3 Bayesian type of games |
|
|
55 | (3) |
|
3.3.1 An example of a Bayesian type of game |
|
|
56 | (2) |
|
3.4 When payoffs need to be partitioned: Player truthfulness |
|
|
58 | (19) |
|
|
|
58 | (1) |
|
3.4.2 Cooperative bargaining model |
|
|
59 | (6) |
|
3.4.3 A Bayesian form of the payment-partition game |
|
|
65 | (4) |
|
3.4.4 Evaluating the game |
|
|
69 | (8) |
|
4 Cooperation for many: Spatial Prisoner's Dilemma and games in neighborhoods |
|
|
77 | (20) |
|
|
|
77 | (1) |
|
4.2 Spatial version of the Prisoner's Dilemma game |
|
|
78 | (1) |
|
4.3 Group strategies for the Prisoner's Dilemma game |
|
|
79 | (4) |
|
4.4 Spatial games and group strategies: Reducing interference in dense deployments of home wireless networks |
|
|
83 | (12) |
|
|
|
84 | (1) |
|
4.4.2 Wireless deployments in urban environments |
|
|
85 | (1) |
|
4.4.3 Cooperative neighborhoods |
|
|
86 | (7) |
|
4.4.4 A protocol for cooperative neighborhoods |
|
|
93 | (2) |
|
4.5 Conclusions on neighborhood games |
|
|
95 | (2) |
|
5 Cooperation for many: Payoffs to coalitions |
|
|
97 | (26) |
|
|
|
97 | (1) |
|
|
|
98 | (1) |
|
|
|
99 | (3) |
|
5.4 Players' power to affect decisions in a coalition game |
|
|
102 | (2) |
|
5.5 The Coordination Game |
|
|
104 | (2) |
|
5.6 Cooperation between multiple networks: Coalitions toward network synthesis |
|
|
106 | (15) |
|
|
|
107 | (1) |
|
5.6.2 Network Synthesis Game |
|
|
107 | (4) |
|
|
|
111 | (6) |
|
5.6.4 Evaluating the game |
|
|
117 | (4) |
|
5.7 Conclusions on coalitional games |
|
|
121 | (2) |
|
6 MATLAB implementation: Strategies for Iterated Prisoner's Dilemma type of games |
|
|
123 | (16) |
|
|
|
123 | (1) |
|
6.2 Initializing the execution |
|
|
124 | (1) |
|
6.3 Fixed iterations number |
|
|
124 | (2) |
|
6.4 Randomized iteration number |
|
|
126 | (1) |
|
6.5 Strategies and payoffs |
|
|
127 | (1) |
|
6.6 Collecting cumulative payoffs |
|
|
127 | (2) |
|
6.7 A single round of the game |
|
|
129 | (3) |
|
6.8 Implementing strategies with non-cooperative nature |
|
|
132 | (1) |
|
6.9 Implementing a simple modification of the Grim Trigger strategy |
|
|
132 | (2) |
|
6.10 Implementing adaptive strategies |
|
|
134 | (5) |
| Index |
|
139 | |
Josephina Antoniou received her B.A. degree (summa cum laude) in Computer Science and Mathematics from Wartburg College, Iowa, USA in May 2002. She received her M.Sc degree in Advanced Computer Technologies from the University of Cyprus in June 2004. She also received her Ph.D. at the University of Cyprus, in the area of mobile networks. She has been a Research Associate for the University of Cyprus working since June 2002, for the, IST/ICT funded projects: SEACORN, B-BONE, C-MOBILE and CCAST dealing with Enhanced UMTS. MBMS over UMTS, enhanced MBMS over converged networks and currently context-aware multicasting over converged, next generation networks. Her research interests include radio resource management and session management in mobile networks, specifically Access Network Selection algorithms in next generation mobile networks using game theoretic approaches. (http://www.NetRL.ucy.ac.cy)
Andreas Pitsillides is a Professor of Computer Science, University of Cyprus (UCY), serves as Chairman of the Cyprus Research and Academic Network (CYNET), and heads the Networks Research Lab (NetRL) at UCY. His research interests include fixed and wireless Networks (ad-hock and sensor networks, VANETS, WLANs&WMANs, UMTS Third Generation mobile networks and beyond, LTE and enhanced LTE, 4G), flow and congestion control, resource allocation and radio resource management. Also his research interests span the Internet- and Web- of Things, and Internet technologies and their application in Mobile e-Services, e.g. in Tele-Healthcare, and security issues. He has a particular interest in adapting tools from various fields of applied mathematics such as adaptive non-linear control theory, computational intelligence, and recently nature inspired techniques, to solve problems in communication networks. Andreas has published over 230 referred journal papers in flagship IEEE, Elsevier, IFAC, and Springer journals, international conferences, and book chapters, he is the co-editor with Petros Ioannou of the book on Modelling and Control of Complex Systems (CRC Press, ISBN: 978-0-8493-7985-0, 2007), presented invited keynotes and invited lectures at major research organisations and universities, has given short courses at international conferences and short courses to industry. He serves on the editorial boards of the Journal of Computer Networks (COMNET) and International Journal of Handheld Computing Research (IJHCR), served on international conferences as General Chair (MEDHOCNET2012, ICT2011, EuroMedNet98), Vice General Chair (WiOpt07), international co-chair (INFOCOM 2003), technical program chair (MCCS05, ISYC06), and on executive committees (e.g. INFOCOM 20012003, and ICT98), technical committees, guest co-editor, invited speaker, and as a regular reviewer for conference and journal submissions. He is also a member of the International Federation of Automatic Control (IFAC) Technical Committee (TC 1.5) on Networked Systems, IFAC TC 7.4 on Transportation Systems and the IFIP working group WG 6.3. Andreas is also very active in competitive research projects. He participated in over 30 European Commission, Microsoft Research Labs (Cambridge), and locally funded research projects.
http://www.NetRL.ucy.ac.cy)
Lisainfo e-raamatute kohta