Nash Equilibria, Gale Strings, and Perfect Matchings PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Nash Equilibria, Gale Strings, and Perfect Matchings PDF full book. Access full book title Nash Equilibria, Gale Strings, and Perfect Matchings by Julian Merschen. Download full books in PDF and EPUB format.
Author: Julian Merschen
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
This thesis concerns the problem 2-NASH of finding a Nash equilibrium of a bimatrix game, for the special class of so-called "hard-to-solve" bimatrix games. The term "hardto-solve" relates to the exponential running time of the famous and often used Lemke- Howson algorithm for this class of games. The games are constructed with the help of dual cyclic polytopes, where the algorithm can be expressed combinatorially via labeled bitstrings defined by the "Gale evenness condition" that characterise the vertices of these polytopes. We define the combinatorial problem "Another completely labeled Gale string" whose solutions define the Nash equilibria of any game defined by cyclic polytopes, including the games where the Lemke-Howson algorithm takes exponential time. We show that "Another completely labeled Gale string" is solvable in polynomial time by a reduction to the "Perfect matching" problem in Euler graphs. We adapt the Lemke-Howson algorithm to pivot from one perfect matching to another and show that again for a certain class of graphs this leads to exponential behaviour. Furthermore, we prove that completely labeled Gale strings and perfect matchings in Euler graphs come in pairs and that the Lemke-Howson algorithm connects two strings or matchings of opposite signs. The equivalence between Nash Equilibria of bimatrix games derived from cyclic polytopes, completely labeled Gale strings, and perfect matchings in Euler Graphs implies that counting Nash equilibria is #P-complete. Although one Nash equilibrium can be computed in polynomial time, we have not succeeded in finding an algorithm that computes a Nash equilibrium of opposite sign. However, we solve this problem for certain special cases, for example planar graphs. We illustrate the difficulties concerning a general polynomial-time algorithm for this problem by means of negative results that demonstrate why a number of approaches towards such an algorithm are unlikely to be successful.
Author: Julian Merschen
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
This thesis concerns the problem 2-NASH of finding a Nash equilibrium of a bimatrix game, for the special class of so-called "hard-to-solve" bimatrix games. The term "hardto-solve" relates to the exponential running time of the famous and often used Lemke- Howson algorithm for this class of games. The games are constructed with the help of dual cyclic polytopes, where the algorithm can be expressed combinatorially via labeled bitstrings defined by the "Gale evenness condition" that characterise the vertices of these polytopes. We define the combinatorial problem "Another completely labeled Gale string" whose solutions define the Nash equilibria of any game defined by cyclic polytopes, including the games where the Lemke-Howson algorithm takes exponential time. We show that "Another completely labeled Gale string" is solvable in polynomial time by a reduction to the "Perfect matching" problem in Euler graphs. We adapt the Lemke-Howson algorithm to pivot from one perfect matching to another and show that again for a certain class of graphs this leads to exponential behaviour. Furthermore, we prove that completely labeled Gale strings and perfect matchings in Euler graphs come in pairs and that the Lemke-Howson algorithm connects two strings or matchings of opposite signs. The equivalence between Nash Equilibria of bimatrix games derived from cyclic polytopes, completely labeled Gale strings, and perfect matchings in Euler Graphs implies that counting Nash equilibria is #P-complete. Although one Nash equilibrium can be computed in polynomial time, we have not succeeded in finding an algorithm that computes a Nash equilibrium of opposite sign. However, we solve this problem for certain special cases, for example planar graphs. We illustrate the difficulties concerning a general polynomial-time algorithm for this problem by means of negative results that demonstrate why a number of approaches towards such an algorithm are unlikely to be successful.
Author: Anna R. Karlin
Publisher: American Mathematical Soc.
ISBN: 1470419823
Category : Mathematics
Languages : en
Pages : 400
Get Book Here
Book Description
We live in a highly connected world with multiple self-interested agents interacting and myriad opportunities for conflict and cooperation. The goal of game theory is to understand these opportunities. This book presents a rigorous introduction to the mathematics of game theory without losing sight of the joy of the subject. This is done by focusing on theoretical highlights (e.g., at least six Nobel Prize winning results are developed from scratch) and by presenting exciting connections of game theory to other fields such as computer science (algorithmic game theory), economics (auctions and matching markets), social choice (voting theory), biology (signaling and evolutionary stability), and learning theory. Both classical topics, such as zero-sum games, and modern topics, such as sponsored search auctions, are covered. Along the way, beautiful mathematical tools used in game theory are introduced, including convexity, fixed-point theorems, and probabilistic arguments. The book is appropriate for a first course in game theory at either the undergraduate or graduate level, whether in mathematics, economics, computer science, or statistics. The importance of game-theoretic thinking transcends the academic setting—for every action we take, we must consider not only its direct effects, but also how it influences the incentives of others.
Author: Tim Roughgarden
Publisher: Cambridge University Press
ISBN: 1316781178
Category : Computers
Languages : en
Pages : 356
Get Book Here
Book Description
Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.
Author: Bernhard von Stengel
Publisher: Cambridge University Press
ISBN: 1108843301
Category : Business & Economics
Languages : en
Pages : 375
Get Book Here
Book Description
A lively introduction to Game Theory, ideal for students in mathematics, computer science, or economics.
Author: Nicolo Cesa-Bianchi
Publisher: Cambridge University Press
ISBN: 113945482X
Category : Computers
Languages : en
Pages : 4
Get Book Here
Book Description
This important text and reference for researchers and students in machine learning, game theory, statistics and information theory offers a comprehensive treatment of the problem of predicting individual sequences. Unlike standard statistical approaches to forecasting, prediction of individual sequences does not impose any probabilistic assumption on the data-generating mechanism. Yet, prediction algorithms can be constructed that work well for all possible sequences, in the sense that their performance is always nearly as good as the best forecasting strategy in a given reference class. The central theme is the model of prediction using expert advice, a general framework within which many related problems can be cast and discussed. Repeated game playing, adaptive data compression, sequential investment in the stock market, sequential pattern analysis, and several other problems are viewed as instances of the experts' framework and analyzed from a common nonstochastic standpoint that often reveals new and intriguing connections.
Author: Peter C. Cramton
Publisher: MIT Press (MA)
ISBN:
Category : Business & Economics
Languages : en
Pages : 678
Get Book Here
Book Description
A synthesis of theoretical and practical research on combinatorial auctions from the perspectives of economics, operations research, and computer science.
Author: Shing-Tung Yau
Publisher: Il Saggiatore
ISBN: 0465020232
Category : Mathematics
Languages : en
Pages : 398
Get Book Here
Book Description
The leading mind behind the mathematics of string theory discusses how geometry explains the universe we see. Illustrations.
Author: Lars Ljungqvist
Publisher: MIT Press
ISBN: 9780262122740
Category : Business & Economics
Languages : en
Pages : 1120
Get Book Here
Book Description
A significant new edition of a text that offers both tools and sample applications; extensive revisions and seven new chapters improve and expand upon the original treatment.
Author: Ulle Endriss
Publisher: Lulu.com
ISBN: 1326912097
Category : Computers
Languages : en
Pages : 424
Get Book Here
Book Description
Computational social choice is concerned with the design and analysis of methods for collective decision making. It is a research area that is located at the interface of computer science and economics. The central question studied in computational social choice is that of how best to aggregate the individual points of view of several agents, so as to arrive at a reasonable compromise. Examples include tallying the votes cast in an election, aggregating the professional opinions of several experts, and finding a fair manner of dividing a set of resources amongst the members of a group -- Back cover.
Author: Tony Bennett
Publisher: John Wiley & Sons
ISBN: 1118725417
Category : Social Science
Languages : en
Pages : 470
Get Book Here
Book Description
Over 25 years ago, Raymond Williams’ Keywords: A Vocabulary of Culture and Society set the standard for how we understand and use the language of culture and society. Now, three luminaries in the field of cultural studies have assembled a volume that builds on and updates Williams’ classic, reflecting the transformation in culture and society since its publication. New Keywords: A Revised Vocabulary of Culture and Society is a state-of-the-art reference for students, teachers and culture vultures everywhere. Assembles a stellar team of internationally renowned and interdisciplinary social thinkers and theorists Showcases 142 signed entries – from art, commodity, and fundamentalism to youth, utopia, the virtual, and the West – that capture the practices, institutions, and debates of contemporary society Builds on and updates Raymond Williams’s classic Keywords: A Vocabulary of Culture and Society, by reflecting the transformation in culture and society over the last 25 years Includes a bibliographic resource to guide research and cross-referencing The book is supported by a website: www.blackwellpublishing.com/newkeywords.
