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...
Saved in:
Superior document: | Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2017 |
---|---|
VerfasserIn: | |
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!
|
id |
9781400885442 |
---|---|
ctrlnum |
(DE-B1597)479722 (OCoLC)984688583 |
collection |
bib_alma |
record_format |
marc |
spelling |
Hespanha, João P., author. aut http://id.loc.gov/vocabulary/relators/aut Noncooperative Game Theory : An Introduction for Engineers and Computer Scientists / João P. Hespanha. Pilot project,eBook available to selected US libraries only Princeton, NJ : Princeton University Press, [2017] ©2017 1 online resource (248 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda Frontmatter -- Contents -- Preamble -- Part I. Introduction -- Part II. Zero-Sum Games -- Part III. Non-Zero-Sum Games -- Part IV. Dynamic Games -- References -- Index restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star 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 Issued also in print. Mode of access: Internet via World Wide Web. In English. Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) Cooperative games (Mathematics) Textbooks. Game theory Textbooks. Noncooperative games (Mathematics) Textbooks. MATHEMATICS / Game Theory. bisacsh 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. Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2017 9783110543322 print 9780691175218 https://doi.org/10.1515/9781400885442?locatt=mode:legacy https://www.degruyter.com/isbn/9781400885442 Cover https://www.degruyter.com/cover/covers/9781400885442.jpg |
language |
English |
format |
eBook |
author |
Hespanha, João P., Hespanha, João P., |
spellingShingle |
Hespanha, João P., Hespanha, João P., Noncooperative Game Theory : An Introduction for Engineers and Computer Scientists / Frontmatter -- Contents -- Preamble -- Part I. Introduction -- Part II. Zero-Sum Games -- Part III. Non-Zero-Sum Games -- Part IV. Dynamic Games -- References -- Index |
author_facet |
Hespanha, João P., Hespanha, João P., |
author_variant |
j p h jp jph j p h jp jph |
author_role |
VerfasserIn VerfasserIn |
author_sort |
Hespanha, João P., |
title |
Noncooperative Game Theory : An Introduction for Engineers and Computer Scientists / |
title_sub |
An Introduction for Engineers and Computer Scientists / |
title_full |
Noncooperative Game Theory : An Introduction for Engineers and Computer Scientists / João P. Hespanha. |
title_fullStr |
Noncooperative Game Theory : An Introduction for Engineers and Computer Scientists / João P. Hespanha. |
title_full_unstemmed |
Noncooperative Game Theory : An Introduction for Engineers and Computer Scientists / João P. Hespanha. |
title_auth |
Noncooperative Game Theory : An Introduction for Engineers and Computer Scientists / |
title_alt |
Frontmatter -- Contents -- Preamble -- Part I. Introduction -- Part II. Zero-Sum Games -- Part III. Non-Zero-Sum Games -- Part IV. Dynamic Games -- References -- Index |
title_new |
Noncooperative Game Theory : |
title_sort |
noncooperative game theory : an introduction for engineers and computer scientists / |
publisher |
Princeton University Press, |
publishDate |
2017 |
physical |
1 online resource (248 p.) Issued also in print. |
edition |
Pilot project,eBook available to selected US libraries only |
contents |
Frontmatter -- Contents -- Preamble -- Part I. Introduction -- Part II. Zero-Sum Games -- Part III. Non-Zero-Sum Games -- Part IV. Dynamic Games -- References -- Index |
isbn |
9781400885442 9783110543322 9780691175218 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA272 |
callnumber-sort |
QA 3272.5 H47 42018 |
genre_facet |
Textbooks. |
url |
https://doi.org/10.1515/9781400885442?locatt=mode:legacy https://www.degruyter.com/isbn/9781400885442 https://www.degruyter.com/cover/covers/9781400885442.jpg |
illustrated |
Not Illustrated |
dewey-hundreds |
500 - Science |
dewey-tens |
510 - Mathematics |
dewey-ones |
519 - Probabilities & applied mathematics |
dewey-full |
519.3 |
dewey-sort |
3519.3 |
dewey-raw |
519.3 |
dewey-search |
519.3 |
doi_str_mv |
10.1515/9781400885442?locatt=mode:legacy |
oclc_num |
984688583 |
work_keys_str_mv |
AT hespanhajoaop noncooperativegametheoryanintroductionforengineersandcomputerscientists |
status_str |
n |
ids_txt_mv |
(DE-B1597)479722 (OCoLC)984688583 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2017 |
is_hierarchy_title |
Noncooperative Game Theory : An Introduction for Engineers and Computer Scientists / |
container_title |
Title is part of eBook package: De Gruyter Princeton University Press Complete eBook-Package 2017 |
_version_ |
1806143646677860352 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>08056nam a22018975i 4500</leader><controlfield tag="001">9781400885442</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20172017nju fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)991042043</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400885442</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400885442</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)479722</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)984688583</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA272.5</subfield><subfield code="b">.H47 2018</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT011000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hespanha, João P., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Noncooperative Game Theory :</subfield><subfield code="b">An Introduction for Engineers and Computer Scientists /</subfield><subfield code="c">João P. Hespanha.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Pilot project,eBook available to selected US libraries only</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (248 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">Contents -- </subfield><subfield code="t">Preamble -- </subfield><subfield code="t">Part I. Introduction -- </subfield><subfield code="t">Part II. Zero-Sum Games -- </subfield><subfield code="t">Part III. Non-Zero-Sum Games -- </subfield><subfield code="t">Part IV. Dynamic Games -- </subfield><subfield code="t">References -- </subfield><subfield code="t">Index</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Cooperative games (Mathematics)</subfield><subfield code="v">Textbooks.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Game theory</subfield><subfield code="v">Textbooks.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Noncooperative games (Mathematics)</subfield><subfield code="v">Textbooks.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Game Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">MATLAB.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Minimax Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">N-player game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Nash equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Separating Hyperplane Theorem.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Sudoku puzzle.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">action space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">action.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">admissible Nash equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">advertising campaign.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">alternate play.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">average security level.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">battle of the sexes.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">behavioral policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">behavioral saddle-point equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">best-response equivalent games.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bilateral symmetric game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bimatrix game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">bimatrix potential.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">chicken game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">circuit design.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">completely mixed Nash equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational complexity.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computer science.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">congestion game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">continuous time cost-to-go.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">continuous time differential.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">continuous time dynamic programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">continuous time dynamic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">convex analysis.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">convex hull.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">decoupled game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">design methodology.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">differential game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">discrete time cost-to-go.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">discrete time dynamic programming.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">discrete time dynamic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">distributed resource allocation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dummy game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">dynamic game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">engineering.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">extensive form game representation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">feedback game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">fictitious play.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">finite one-player.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">game theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graphical method.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">hyperplane.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">identical interests.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">information structure.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">linear program.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">linear quadratic dynamic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">minimum.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mixed Nash equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mixed action space.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mixed policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mixed saddle-point equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mixed security policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">multi-stage game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network routing.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">non-feedback game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">non-zero-sum.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">noncooperative game theory.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">open-loop policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">open-loop.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">optimization-based design.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">order interchangeability property.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">potential game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">probability distribution.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">pure N-player game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">pure policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">recursive computation.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">regret.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">robust design.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">rock-paper-scissors.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">rope-pulling.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">saddle-point equilibrium.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">security level.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">security policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">simultaneous play.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">single-stage game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">state feedback information structure.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">state-feedback policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">stochastic policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">strictly dominating policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">symmetry game.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">tic-tac-toe.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">tree structure.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">uncertainty.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">variable termination time.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">war of attrition.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">weakly dominating policy.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">zebra in the lake.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">zero sum dynamic.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">zero-sum matrix.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">zero-sum two-person.</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">zero-sum.</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press Complete eBook-Package 2017</subfield><subfield code="z">9783110543322</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691175218</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400885442?locatt=mode:legacy</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400885442</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781400885442.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-054332-2 Princeton University Press Complete eBook-Package 2017</subfield><subfield code="b">2017</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection> |