Default Theme

Lectures in game theory for computer scientists / edited by Krzysztof R. Apt and Erich Grädel.

Call Number	004.015193
Title	Lectures in game theory for computer scientists / edited by Krzysztof R. Apt and Erich Grädel.
Physical Description	1 online resource (xii, 295 pages) : digital, PDF file(s).
Notes	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Contents	A Primer on Strategic Games / Introduction -- Basic concepts -- Iterated elimination of strategies I -- Mixed extension -- Iterated elimination of strategies II -- Variations on the definition of strategic games -- Mechanism design -- Pre-Bayesian games -- Conclusions -- Infinite Games and Automata Theory / Introduction -- Basic notations and definitions -- Transformation of winning conditions -- Tree automata -- Beyond finite automata -- Conclusion -- Algorithms for Solving Parity Games / Games on graphs -- Solving repeated reachability and eventual safety games. Solving parity games -- Related work -- Back and Forth Between Logic and Games / Introduction -- Reachability games and parity games -- Reachability games and logic -- Logics with least and greatest fixed-points -- Definability of winning regions in parity games -- Inflationary fixed-point logic and backtracking games -- Logic and games in a quantitative setting -- Turn-Based Stochastic Games / Introduction -- Winning objectives in stochastic games -- Reachability objectives in games with finitely and infinitely many vertices -- Some directions of future research -- Games with Imperfect Information: Theory and Algorithms / Introduction -- Games with perfect information. Games with imperfect information: surely-winning -- Games with imperfect information: almost-surely-winning -- Graph Searching Games / Introduction -- Classifying graph searching games -- Variants of graph searching games -- Monotonicity of graph searching -- Obstructions -- An application to graph-decompositions -- Complexity of graph searching -- Conclusion -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century / Introduction -- Robust and resilient equilibrium -- Taking computation into account -- Taking (lack of) awareness into account -- Iterated regret minimisation -- Conclusions.
Summary	Games 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.
Added Author	Apt, Krzysztof R., 1949- editor. Grädel, Erich, 1958- editor.
Subject	GAME THEORY. Computer science Mathematics.
Multimedia	https://doi.org/10.1017/CBO9780511973468

Total Ratings: 0

Copies
MARC Record
Reviews
Details


No records found to display.

04827nam a22003978i 4500

001

vtls001584907

003

VRT

005

20200921122200.0

006

m|||||o||d||||||||

007

cr||||||||||||

008

200921s2011||||enk o ||1 0|eng|d

020

$a 9780511973468 (ebook)

020

$z 9780521198660 (hardback)

035

$a (UkCbUP)CR9780511973468

039

$y 202009211222 $z santha

040

$a UkCbUP $b eng $e rda $c UkCbUP

050

$a QA269 $b .L43 2011

082

$a 004.015193 $2 22

245

$a Lectures in game theory for computer scientists / $c edited by Krzysztof R. Apt and Erich Grädel.

264

$a Cambridge : $b Cambridge University Press, $c 2011.

300

$a 1 online resource (xii, 295 pages) : $b digital, PDF file(s).

336

$a text $b txt $2 rdacontent

337

$a computer $b c $2 rdamedia

338

$a online resource $b cr $2 rdacarrier

500

$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).

505

$g Machine generated contents note: $g 1. $t A Primer on Strategic Games / $r Krzysztof R. Apt -- $g 1.1. $t Introduction -- $g 1.2. $t Basic concepts -- $g 1.3. $t Iterated elimination of strategies I -- $g 1.4. $t Mixed extension -- $g 1.5. $t Iterated elimination of strategies II -- $g 1.6. $t Variations on the definition of strategic games -- $g 1.7. $t Mechanism design -- $g 1.8. $t Pre-Bayesian games -- $g 1.9. $t Conclusions -- $g 2. $t Infinite Games and Automata Theory / $r Christof Loding -- $g 2.1. $t Introduction -- $g 2.2. $t Basic notations and definitions -- $g 2.3. $t Transformation of winning conditions -- $g 2.4. $t Tree automata -- $g 2.5. $t Beyond finite automata -- $g 2.6. $t Conclusion -- $g 3. $t Algorithms for Solving Parity Games / $r Marcin Jurdzinski -- $g 3.1. $t Games on graphs -- $g 3.2. $t Solving repeated reachability and eventual safety games.

505

$g 3.3. $t Solving parity games -- $g 3.4. $t Related work -- $g 4. $t Back and Forth Between Logic and Games / $r Erich Gradel -- $g 4.1. $t Introduction -- $g 4.2. $t Reachability games and parity games -- $g 4.3. $t Reachability games and logic -- $g 4.4. $t Logics with least and greatest fixed-points -- $g 4.5. $t Definability of winning regions in parity games -- $g 4.6. $t Inflationary fixed-point logic and backtracking games -- $g 4.7. $t Logic and games in a quantitative setting -- $g 5. $t Turn-Based Stochastic Games / $r Antonin Kucera -- $g 5.1. $t Introduction -- $g 5.2. $t Winning objectives in stochastic games -- $g 5.3. $t Reachability objectives in games with finitely and infinitely many vertices -- $g 5.4. $t Some directions of future research -- $g 6. $t Games with Imperfect Information: Theory and Algorithms / $r Jean-Francois Raskin -- $g 6.1. $t Introduction -- $g 6.2. $t Games with perfect information.

505

$g 6.3. $t Games with imperfect information: surely-winning -- $g 6.4. $t Games with imperfect information: almost-surely-winning -- $g 7. $t Graph Searching Games / $r Stephan Kreuizer -- $g 7.1. $t Introduction -- $g 7.2. $t Classifying graph searching games -- $g 7.3. $t Variants of graph searching games -- $g 7.4. $t Monotonicity of graph searching -- $g 7.5. $t Obstructions -- $g 7.6. $t An application to graph-decompositions -- $g 7.7. $t Complexity of graph searching -- $g 7.8. $t Conclusion -- $g 8. $t Beyond Nash Equilibrium: Solution Concepts for the 21st Century / $r Joseph Y. Halpern -- $g 8.1. $t Introduction -- $g 8.2. $t Robust and resilient equilibrium -- $g 8.3. $t Taking computation into account -- $g 8.4. $t Taking (lack of) awareness into account -- $g 8.5. $t Iterated regret minimisation -- $g 8.6. $t Conclusions.

520

$a Games 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

$a GAME THEORY.

650

$a Computer science $x Mathematics.

700

$a Apt, Krzysztof R., $d 1949- $e editor.

700

$a Grädel, Erich, $d 1958- $e editor.

776

$i Print version: $z 9780521198660

856

$u https://doi.org/10.1017/CBO9780511973468

999

$a VIRTUA

No Reviews to Display

Summary	Games 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.
Notes	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Contents	A Primer on Strategic Games / Introduction -- Basic concepts -- Iterated elimination of strategies I -- Mixed extension -- Iterated elimination of strategies II -- Variations on the definition of strategic games -- Mechanism design -- Pre-Bayesian games -- Conclusions -- Infinite Games and Automata Theory / Introduction -- Basic notations and definitions -- Transformation of winning conditions -- Tree automata -- Beyond finite automata -- Conclusion -- Algorithms for Solving Parity Games / Games on graphs -- Solving repeated reachability and eventual safety games. Solving parity games -- Related work -- Back and Forth Between Logic and Games / Introduction -- Reachability games and parity games -- Reachability games and logic -- Logics with least and greatest fixed-points -- Definability of winning regions in parity games -- Inflationary fixed-point logic and backtracking games -- Logic and games in a quantitative setting -- Turn-Based Stochastic Games / Introduction -- Winning objectives in stochastic games -- Reachability objectives in games with finitely and infinitely many vertices -- Some directions of future research -- Games with Imperfect Information: Theory and Algorithms / Introduction -- Games with perfect information. Games with imperfect information: surely-winning -- Games with imperfect information: almost-surely-winning -- Graph Searching Games / Introduction -- Classifying graph searching games -- Variants of graph searching games -- Monotonicity of graph searching -- Obstructions -- An application to graph-decompositions -- Complexity of graph searching -- Conclusion -- Beyond Nash Equilibrium: Solution Concepts for the 21st Century / Introduction -- Robust and resilient equilibrium -- Taking computation into account -- Taking (lack of) awareness into account -- Iterated regret minimisation -- Conclusions.
Subject	GAME THEORY. Computer science Mathematics.
Multimedia	https://doi.org/10.1017/CBO9780511973468