Noncooperative game theory: an introduction for engineers and computer scientists

Noncooperative Game Theory is aimed at students interested in using game theory as a design methodology for solving problems in engineering and computer science. João Hespanha shows that such design challenges can be analyzed through game theoretical perspectives that help to pinpoint each problem's essence: Who are the players? What are their goals? Will the solution to "the game" solve the original design problem? Using the fundamentals of game theory, Hespanha explores these issues and more. The use of game theory in technology design is a recent development arising from the intrinsic limitations of classical optimization-based designs. In optimization, one attempts to find values for parameters that minimize suitably defined criteria--such as monetary cost, energy consumption, or heat generated. However, in most engineering applications, there is always some uncertainty as to how the selected parameters will affect the final objective. Through a sequential and easy-to-understand discussion, Hespanha examines how to make sure that the selection leads to acceptable performance, even in the presence of uncertainty--the unforgiving variable that can wreck engineering designs. Hespanha looks at such standard topics as zero-sum, non-zero-sum, and dynamics games and includes a MATLAB guide to coding. Noncooperative Game Theory offers students a fresh way of approaching engineering and computer science applications. An introduction to game theory applications for students of engineering and computer science Materials presented sequentially and in an easy-to-understand fashionTopics explore zero-sum, non-zero-sum, and dynamics gamesMATLAB commands are included.

10.2 Computation of Completely Mixed Nash Equilibria.

Cover; NONCOOPERATIVE GAME THEORY; Title; Copyright; Dedication; CONTENTS; Preamble; I INTRODUCTION; 1 Noncooperative Games; 1.1 Elements of a Game; 1.2 Cooperative vs. Noncooperative Games: Rope-Pulling; 1.3 Robust Designs: Resistive Circuit; 1.4 Mixed Policies: Network Routing; 1.5 Nash Equilibrium; 1.6 Practice Exercise; 2 Policies; 2.1 Actions vs. Policies: Advertising Campaign; 2.2 Multi-Stage Games:War of Attrition; 2.3 Open vs. Closed-Loop: Zebra in the Lake; 2.4 Practice Exercises; II ZERO-SUM GAMES; 3 Zero-Sum Matrix Games; 3.1 Zero-Sum Matrix Games; 3.2 Security Levels and Policies.

3.3 Computing Security Levels and Policies with MATLAB®3.4 Security vs. Regret: Alternate Play; 3.5 Security vs. Regret: Simultaneous Plays; 3.6 Saddle-Point Equilibrium; 3.7 Saddle-Point Equilibrium vs. Security Levels; 3.8 Order Interchangeability; 3.9 Computational Complexity; 3.10 Practice Exercise; 3.11 Additional Exercise; 4 Mixed Policies; 4.1 Mixed Policies: Rock-Paper-Scissor; 4.2 Mixed Action Spaces; 4.3 Mixed Security Policies and Saddle-Point Equilibrium; 4.4 Mixed Saddle-Point Equilibrium vs. Average Security Levels; 4.5 General Zero-Sum Games; 4.6 Practice Exercises.

4.7 Addit…