Custom cover image
Game Theory for Control of Optical Networks / by Lacra Pavel
Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: Static & Dynamic Game Theory: Foundations & Applications | SpringerLink BücherPublisher: Boston : Birkhäuser Boston, 2012Description: Online-Ressource (XIII, 261p. 92 illus., 70 illus. in color, digital)ISBN:- 9780817683221
- 519.3
- 519
- HB144 QA269-272
- HB144
- QA269-272
Contents:
Summary: Preface -- 1 Introduction -- Part I Game Theory Essentials -- 2 Basics of Game Theory -- 3 Matrix Games -- 4 Games with Continuous Action Spaces -- 5 Computational Results for Games with Coupled Constraints -- Part II Game Theory in Optical Networks.- 6 Optical Networks: Background and Modeling.- 7 Games in Point-to-Point Topologies.- 8 Games in Network Toplogies.- 9 Nash Equilibria Efficiency and Numerical Studies -- 10 Simulations and Experimental Studies -- Part III Robustness, Delay Effects, and Other Problems.- 11 Robustness and Delay Effects onNetwork Games.- 12 Games for Routing and Path Coloring -- 13 Summary and Conclusions. A Supplementary Material -- B List of Notations -- References -- Index.Summary: Optical networks epitomize complex communication systems, and they comprise the Internet’s infrastructural backbone. The first of its kind, this book develops the mathematical framework needed from a control perspective to tackle various game-theoretical problems in optical networks. In doing so, it aims to help design control algorithms that optimally allocate the resources of these networks. The book’s main focus is a control-theoretic analysis of dynamic systems arising from game formulations with non-separable player utilities and with coupled as well as propagated (modified) constraints. Compared with the conventional static optimization approach, this provides a more realistic model of how optical networks operate. Its methods and techniques could be used to improve networks’ functionality and adaptivity, potentially enhancing the speed and reliability of communications throughout the world. With its fresh problem-solving approach, Game Theory for Control of Optical Networks is a unique resource for researchers, practitioners, and graduate students in applied mathematics and systems/control engineering, as well as those in electrical and computer engineering.PPN: PPN: 1651476691Package identifier: Produktsigel: ZDB-2-SEB | ZDB-2-SXMS | ZDB-2-SMA
Game Theory for Control of Optical Networks; Preface; Contents; List of Acronyms; Chapter 1: Introduction; 1.1 Game Theory in Networks; 1.2 Optical Networks; 1.3 Scope of This Monograph; Part I: Game Theory Essentials; Chapter 2: Basics of Game Theory; 2.1 Introduction; 2.2 Game Formulations; 2.3 Games in Extensive Form; 2.4 Games in Normal Form; 2.5 Game Features; 2.5.1 Strategy Space: Matrix vs. Continuous Games; 2.5.2 Mixed vs. Pure Strategy Games; 2.5.3 Competitive Versus Cooperative; 2.5.3.1 Coordination Games; 2.5.3.2 Constant-Sum Games; 2.5.3.3 Games of Conflicting Interests
2.5.4 Repetition2.5.4.1 One-Shot Games; 2.5.4.2 Repeated Games; 2.5.4.3 Dynamic Games; 2.5.5 Knowledge Information; 2.6 Solution Concepts; 2.6.1 Minimax Solution; 2.6.2 Best Response; 2.6.3 Nash Equilibrium Solution; 2.6.4 Pareto Optimality; 2.7 The Rationality Assumption; 2.8 Learning in Classical Games; 2.9 Notes; Chapter 3: Matrix Games; 3.1 Introduction; 3.2 Bimatrix Games; 3.2.1 Mixed Strategies; 3.3 m-Player Games; 3.3.1 Pure and Mixed Strategies; 3.3.2 Mixed-Strategy Cost Functions; 3.4 Dominance and Best Replies; 3.4.1 Best-Response Correspondence; 3.5 Nash Equilibria Theorem
3.6 Nash Equilibria Refinements3.6.1 Perfect Equilibrium; 3.6.2 Proper Equilibrium; 3.6.3 Strategically Stable Equilibrium; 3.7 Notes; Chapter 4: Games with Continuous Action Spaces; 4.1 Introduction; 4.2 Game Formulations; 4.3 Extension to Mixed Strategies; 4.4 Nash Equilibria and Reaction Curves; 4.5 Existence and Uniqueness Results; 4.6 Notes; Chapter 5: Computational Results for Games with Coupled Constraints; 5.1 Introduction; 5.2 Nash Equilibria and Relaxation via an Augmented Optimization; 5.3 Lagrangian Extension in a Game Setup; 5.4 Duality Extension
5.5 Hierarchical Decomposition in a Game Setup5.6 Notes; Part II: Game Theory in Optical Networks; Chapter 6: Optical Networks: Background and Modeling; 6.1 Introduction; 6.2 Transmission Basics; 6.3 Topologies and Setup; 6.4 Power Control and OSNR Model; 6.4.1 Point-to-Point Link Model; 6.4.2 Network Model; 6.4.3 Link Capacity Constraint; 6.5 Notes; Chapter 7: Games in Point-to-Point Topologies; 7.1 Game Formulation; 7.2 Games Without Coupled Constraints; 7.2.1 Utility and Nash Equilibrium Solution; 7.2.2 Iterative Algorithm; (a) Proportional Pricing; (b) Decentralized Pricing
(c) Minimum OSNR Level7.3 Games with Coupled Constraints: Indirect Penalty Approach; 7.3.1 Nash Equilibrium Solution; 7.3.2 Iterative Algorithm and Convergence Analysis; 7.4 Games with Coupled Constraints: Lagrangian Pricing Approach; 7.4.1 Lagrangian Pricing and Duality Extension; 7.4.2 Iterative Algorithm; Link Algorithm; Channel Algorithm; 7.5 Notes; Chapter 8: Games in Network Topologies; 8.1 Introduction; 8.2 Games in gamma-Link Topologies; 8.2.1 Partitioned Game Formulation; 8.3 Games in Single-Sink Topologies; 8.3.1 Convexity Analysis (Coupled Constraints)
8.3.2 Hierarchical Decomposition
No physical items for this record