Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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

Noncooperative games (Mathematics) --- Game theory --- Cooperative games (Mathematics) --- MATLAB. --- Minimax Theorem. --- N-player game. --- Nash equilibrium. --- Separating Hyperplane Theorem. --- Sudoku puzzle. --- action space. --- action. --- admissible Nash equilibrium. --- advertising campaign. --- alternate play. --- average security level. --- battle of the sexes. --- behavioral policy. --- behavioral saddle-point equilibrium. --- best-response equivalent games. --- bilateral symmetric game. --- bimatrix game. --- bimatrix potential. --- chicken game. --- circuit design. --- completely mixed Nash equilibrium. --- computational complexity. --- computer science. --- congestion game. --- continuous time cost-to-go. --- continuous time differential. --- continuous time dynamic programming. --- continuous time dynamic. --- convex analysis. --- convex hull. --- decoupled game. --- design methodology. --- differential game. --- discrete time cost-to-go. --- discrete time dynamic programming. --- discrete time dynamic. --- distributed resource allocation. --- dummy game. --- dynamic game. --- engineering. --- extensive form game representation. --- feedback game. --- fictitious play. --- finite one-player. --- game theory. --- graphical method. --- hyperplane. --- identical interests. --- information structure. --- linear program. --- linear quadratic dynamic. --- minimum. --- mixed Nash equilibrium. --- mixed action space. --- mixed policy. --- mixed saddle-point equilibrium. --- mixed security policy. --- multi-stage game. --- network routing. --- non-feedback game. --- non-zero-sum. --- noncooperative game theory. --- open-loop policy. --- open-loop. --- optimization-based design. --- order interchangeability property. --- policy. --- potential game. --- probability distribution. --- pure N-player game. --- pure policy. --- recursive computation. --- regret. --- robust design. --- rock-paper-scissors. --- rope-pulling. --- saddle-point equilibrium. --- security level. --- security policy. --- simultaneous play. --- single-stage game. --- state feedback information structure. --- state-feedback policy. --- stochastic policy. --- strictly dominating policy. --- symmetry game. --- tic-tac-toe. --- tree structure. --- uncertainty. --- variable termination time. --- war of attrition. --- weakly dominating policy. --- zebra in the lake. --- zero sum dynamic. --- zero-sum matrix. --- zero-sum two-person. --- zero-sum.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Hybrid computers --- Calculateurs hybrides --- Congresses. --- Congrès --- Digital control systems --- Computer Science --- Electrical Engineering --- Engineering & Applied Sciences --- Electrical & Computer Engineering --- Congrès --- EPUB-LIV-FT SPRINGER-B --- Computer science. --- Microprocessors. --- Special purpose computers. --- Software engineering. --- Computers. --- Computer logic. --- Computer Science. --- Theory of Computation. --- Special Purpose and Application-Based Systems. --- Processor Architectures. --- Logics and Meanings of Programs. --- Software Engineering. --- Computation by Abstract Devices. --- Computer science logic --- Logic, Symbolic and mathematical --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Computer software engineering --- Engineering --- Special purpose computers --- Computers --- Minicomputers --- Informatics --- Science --- Automatic control --- Electronic digital computers --- Information theory. --- Logic design. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Communication theory --- Communication --- Hybrid computers - Congresses. --- Digital control systems - Congresses. --- Computers, Special purpose. --- Computer architecture. --- Computer Science Logic and Foundations of Programming. --- Architecture, Computer

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book provides clear presentations of more than sixty important unsolved problems in mathematical systems and control theory. Each of the problems included here is proposed by a leading expert and set forth in an accessible manner. Covering a wide range of areas, the book will be an ideal reference for anyone interested in the latest developments in the field, including specialists in applied mathematics, engineering, and computer science. The book consists of ten parts representing various problem areas, and each chapter sets forth a different problem presented by a researcher in the particular area and in the same way: description of the problem, motivation and history, available results, and bibliography. It aims not only to encourage work on the included problems but also to suggest new ones and generate fresh research. The reader will be able to submit solutions for possible inclusion on an online version of the book to be updated quarterly on the Princeton University Press website, and thus also be able to access solutions, updated information, and partial solutions as they are developed.

System analysis. --- Control theory. --- Commande, Théorie de la. --- Network theory --- Systems analysis --- Dynamics --- Machine theory --- System theory --- Mathematical optimization --- Network analysis --- Network science --- System Analysis --- Control theory --- Commande, théorie de la --- Commande, Theorie de la.