000 04747nam a22003738i 4500
001 CR9780511973468
003 UkCbUP
005 20200124160320.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 101011s2011||||enk o ||1 0|eng|d
020 _a9780511973468 (ebook)
020 _z9780521198660 (hardback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aQA269
_b.L43 2011
082 0 4 _a004.015193
_222
245 0 0 _aLectures in game theory for computer scientists /
_cedited by Krzysztof R. Apt and Erich Grädel.
264 1 _aCambridge :
_bCambridge University Press,
_c2011.
300 _a1 online resource (xii, 295 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505 0 0 _gMachine generated contents note:
_g1.
_tA Primer on Strategic Games /
_rKrzysztof R. Apt --
_g1.1.
_tIntroduction --
_g1.2.
_tBasic concepts --
_g1.3.
_tIterated elimination of strategies I --
_g1.4.
_tMixed extension --
_g1.5.
_tIterated elimination of strategies II --
_g1.6.
_tVariations on the definition of strategic games --
_g1.7.
_tMechanism design --
_g1.8.
_tPre-Bayesian games --
_g1.9.
_tConclusions --
_g2.
_tInfinite Games and Automata Theory /
_rChristof Loding --
_g2.1.
_tIntroduction --
_g2.2.
_tBasic notations and definitions --
_g2.3.
_tTransformation of winning conditions --
_g2.4.
_tTree automata --
_g2.5.
_tBeyond finite automata --
_g2.6.
_tConclusion --
_g3.
_tAlgorithms for Solving Parity Games /
_rMarcin Jurdzinski --
_g3.1.
_tGames on graphs --
_g3.2.
_tSolving repeated reachability and eventual safety games.
505 0 0 _g3.3.
_tSolving parity games --
_g3.4.
_tRelated work --
_g4.
_tBack and Forth Between Logic and Games /
_rErich Gradel --
_g4.1.
_tIntroduction --
_g4.2.
_tReachability games and parity games --
_g4.3.
_tReachability games and logic --
_g4.4.
_tLogics with least and greatest fixed-points --
_g4.5.
_tDefinability of winning regions in parity games --
_g4.6.
_tInflationary fixed-point logic and backtracking games --
_g4.7.
_tLogic and games in a quantitative setting --
_g5.
_tTurn-Based Stochastic Games /
_rAntonin Kucera --
_g5.1.
_tIntroduction --
_g5.2.
_tWinning objectives in stochastic games --
_g5.3.
_tReachability objectives in games with finitely and infinitely many vertices --
_g5.4.
_tSome directions of future research --
_g6.
_tGames with Imperfect Information: Theory and Algorithms /
_rJean-Francois Raskin --
_g6.1.
_tIntroduction --
_g6.2.
_tGames with perfect information.
505 0 0 _g6.3.
_tGames with imperfect information: surely-winning --
_g6.4.
_tGames with imperfect information: almost-surely-winning --
_g7.
_tGraph Searching Games /
_rStephan Kreuizer --
_g7.1.
_tIntroduction --
_g7.2.
_tClassifying graph searching games --
_g7.3.
_tVariants of graph searching games --
_g7.4.
_tMonotonicity of graph searching --
_g7.5.
_tObstructions --
_g7.6.
_tAn application to graph-decompositions --
_g7.7.
_tComplexity of graph searching --
_g7.8.
_tConclusion --
_g8.
_tBeyond Nash Equilibrium: Solution Concepts for the 21st Century /
_rJoseph Y. Halpern --
_g8.1.
_tIntroduction --
_g8.2.
_tRobust and resilient equilibrium --
_g8.3.
_tTaking computation into account --
_g8.4.
_tTaking (lack of) awareness into account --
_g8.5.
_tIterated regret minimisation --
_g8.6.
_tConclusions.
520 _aGames provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Originally devised for a Spring School organised by the GAMES Networking Programme in 2009, these lectures have since been revised and expanded, and range from tutorials concerning fundamental notions and methods to more advanced presentations of current research topics. This volume is a valuable guide to current research on game-based methods in computer science for undergraduate and graduate students. It will also interest researchers working in mathematical logic, computer science and game theory.
650 0 _aGame theory.
650 0 _aComputer science
_xMathematics.
700 1 _aApt, Krzysztof R.,
_d1949-
_eeditor.
700 1 _aGrädel, Erich,
_d1958-
_eeditor.
776 0 8 _iPrint version:
_z9780521198660
856 4 0 _uhttps://doi.org/10.1017/CBO9780511973468
999 _c521858
_d521856