Noncooperative Game Theory : : An Introduction for Engineers and Computer Scientists /

Noncooperative Game Theory : : An Introduction for Engineers and Computer Scientists / / João P. Hespanha.

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&#...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2017
VerfasserIn:
Hespanha, João P.,
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2017]
©2017
Year of Publication:2017
Edition:Pilot project,eBook available to selected US libraries only
Language:English
Online Access:
Physical Description:1 online resource (248 p.)
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 08056nam a22018975i 4500
001 9781400885442
003 DE-B1597
005 20210830012106.0
006 m|||||o||d||||||||
007 cr || ||||||||
008 210830t20172017nju fo d z eng d
019 |a (OCoLC)991042043 
020 |a 9781400885442 
024 7 |a 10.1515/9781400885442  |2 doi 
035 |a (DE-B1597)479722 
035 |a (OCoLC)984688583 
040 |a DE-B1597  |b eng  |c DE-B1597  |e rda 
041 0 |a eng 
044 |a nju  |c US-NJ 
050 4 |a QA272.5  |b .H47 2018 
072 7 |a MAT011000  |2 bisacsh 
082 0 4 |a 519.3  |2 23 
100 1 |a Hespanha, João P.,   |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Noncooperative Game Theory :  |b An Introduction for Engineers and Computer Scientists /  |c João P. Hespanha. 
250 |a Pilot project,eBook available to selected US libraries only 
264 1 |a Princeton, NJ :   |b Princeton University Press,   |c [2017] 
264 4 |c ©2017 
300 |a 1 online resource (248 p.) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 0 |t Frontmatter --   |t Contents --   |t Preamble --   |t Part I. Introduction --   |t Part II. Zero-Sum Games --   |t Part III. Non-Zero-Sum Games --   |t Part IV. Dynamic Games --   |t References --   |t Index 
506 0 |a restricted access  |u http://purl.org/coar/access_right/c_16ec  |f online access with authorization  |2 star 
520 |a 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 
530 |a Issued also in print. 
538 |a Mode of access: Internet via World Wide Web. 
546 |a In English. 
588 0 |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) 
650 0 |a Cooperative games (Mathematics)  |v Textbooks. 
650 0 |a Game theory  |v Textbooks. 
650 0 |a Noncooperative games (Mathematics)  |v Textbooks. 
650 7 |a MATHEMATICS / Game Theory.  |2 bisacsh 
653 |a MATLAB. 
653 |a Minimax Theorem. 
653 |a N-player game. 
653 |a Nash equilibrium. 
653 |a Separating Hyperplane Theorem. 
653 |a Sudoku puzzle. 
653 |a action space. 
653 |a action. 
653 |a admissible Nash equilibrium. 
653 |a advertising campaign. 
653 |a alternate play. 
653 |a average security level. 
653 |a battle of the sexes. 
653 |a behavioral policy. 
653 |a behavioral saddle-point equilibrium. 
653 |a best-response equivalent games. 
653 |a bilateral symmetric game. 
653 |a bimatrix game. 
653 |a bimatrix potential. 
653 |a chicken game. 
653 |a circuit design. 
653 |a completely mixed Nash equilibrium. 
653 |a computational complexity. 
653 |a computer science. 
653 |a congestion game. 
653 |a continuous time cost-to-go. 
653 |a continuous time differential. 
653 |a continuous time dynamic programming. 
653 |a continuous time dynamic. 
653 |a convex analysis. 
653 |a convex hull. 
653 |a decoupled game. 
653 |a design methodology. 
653 |a differential game. 
653 |a discrete time cost-to-go. 
653 |a discrete time dynamic programming. 
653 |a discrete time dynamic. 
653 |a distributed resource allocation. 
653 |a dummy game. 
653 |a dynamic game. 
653 |a engineering. 
653 |a extensive form game representation. 
653 |a feedback game. 
653 |a fictitious play. 
653 |a finite one-player. 
653 |a game theory. 
653 |a graphical method. 
653 |a hyperplane. 
653 |a identical interests. 
653 |a information structure. 
653 |a linear program. 
653 |a linear quadratic dynamic. 
653 |a minimum. 
653 |a mixed Nash equilibrium. 
653 |a mixed action space. 
653 |a mixed policy. 
653 |a mixed saddle-point equilibrium. 
653 |a mixed security policy. 
653 |a multi-stage game. 
653 |a network routing. 
653 |a non-feedback game. 
653 |a non-zero-sum. 
653 |a noncooperative game theory. 
653 |a open-loop policy. 
653 |a open-loop. 
653 |a optimization-based design. 
653 |a order interchangeability property. 
653 |a policy. 
653 |a potential game. 
653 |a probability distribution. 
653 |a pure N-player game. 
653 |a pure policy. 
653 |a recursive computation. 
653 |a regret. 
653 |a robust design. 
653 |a rock-paper-scissors. 
653 |a rope-pulling. 
653 |a saddle-point equilibrium. 
653 |a security level. 
653 |a security policy. 
653 |a simultaneous play. 
653 |a single-stage game. 
653 |a state feedback information structure. 
653 |a state-feedback policy. 
653 |a stochastic policy. 
653 |a strictly dominating policy. 
653 |a symmetry game. 
653 |a tic-tac-toe. 
653 |a tree structure. 
653 |a uncertainty. 
653 |a variable termination time. 
653 |a war of attrition. 
653 |a weakly dominating policy. 
653 |a zebra in the lake. 
653 |a zero sum dynamic. 
653 |a zero-sum matrix. 
653 |a zero-sum two-person. 
653 |a zero-sum. 
773 0 8 |i Title is part of eBook package:  |d De Gruyter  |t Princeton University Press Complete eBook-Package 2017  |z 9783110543322 
776 0 |c print  |z 9780691175218 
856 4 0 |u https://doi.org/10.1515/9781400885442?locatt=mode:legacy 
856 4 0 |u https://www.degruyter.com/isbn/9781400885442 
856 4 2 |3 Cover  |u https://www.degruyter.com/cover/covers/9781400885442.jpg 
912 |a 978-3-11-054332-2 Princeton University Press Complete eBook-Package 2017  |b 2017 
912 |a EBA_BACKALL 
912 |a EBA_CL_MTPY 
912 |a EBA_EBACKALL 
912 |a EBA_EBKALL 
912 |a EBA_ECL_MTPY 
912 |a EBA_EEBKALL 
912 |a EBA_ESTMALL 
912 |a EBA_PPALL 
912 |a EBA_STMALL 
912 |a GBV-deGruyter-alles 
912 |a PDA12STME 
912 |a PDA13ENGE 
912 |a PDA18STMEE 
912 |a PDA5EBK 

Similar Items