Index And Stability In Bimatrix Games
Download Index And Stability In Bimatrix Games PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Index And Stability In Bimatrix Games book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Index and Stability in Bimatrix Games
Author: H. Arndt von Schemde
language: en
Publisher: Springer Science & Business Media
Release Date: 2005-12-11
The index of an equilibrium in a game gives information about the "stability" of the equilibrium, for example with respect to game dynamics. Unfortunately, index theory is often very technical. This book presents a new geometric construction that visualises the index in an intuitive way. For example, a 3A-n game, for any n, can be represented by a figure in the plane, from which one can read off any equilibrium, and its index as a geometric orientation. With this insight, the index can be characterised in strategic terms alone. Moreover, certain "hyperstable" equilibrium components are seen to have nonzero index. The construction gives an elementary proof that two-player games have a Nash equilibrium, and, in an unusual direction, the powerful fixed point theorem of Brouwer.
Index and Stability in Bimatrix Games
The index of an equilibrium in a game gives information about the "stability" of the equilibrium, for example with respect to game dynamics. Unfortunately, index theory is often very technical. This book presents a new geometric construction that visualises the index in an intuitive way. For example, a 3×n game, for any n, can be represented by a figure in the plane, from which one can read off any equilibrium, and its index as a geometric orientation. With this insight, the index can be characterised in strategic terms alone. Moreover, certain "hyperstable" equilibrium components are seen to have nonzero index. The construction gives an elementary proof that two-player games have a Nash equilibrium, and, in an unusual direction, the powerful fixed point theorem of Brouwer.
Algorithmic Game Theory
Author: Noam Nisan
language: en
Publisher: Cambridge University Press
Release Date: 2007-09-24
In recent years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. Algorithmic Game Theory, first published in 2007, develops the central ideas and results of this exciting area in a clear and succinct manner. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on important game theory applications such as incentives and pricing, cost sharing, information markets and cryptography and security. This definitive work will set the tone of research for the next few years and beyond. Students, researchers, and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.