Combinatorial Methods in Cooperative Game Theory PDF Download

Author: Jeroen Kuipers
Publisher:
ISBN: 9789052781419
Category : Game theory
Languages : en
Pages : 151

View

Book Description

Author: Jesús Mario Bilbao
Publisher: Springer Science & Business Media
ISBN: 1461543932
Category : Business & Economics
Languages : en
Pages : 329

View

Book Description
The aim of Cooperative Games on Combinatorial Structures is to analyze conflict situations in which two or more players can make coalitions and obtain prizes and penalties. This approach to situations of competition and cooperation was given in the seminal treatise by John von Neumann and Oskar Morgenstern, Theory of Games and Economic Behavior. Cooperative game theory has succeeded in providing many applications of game theory. In this volume, games defined on combinatorial structures will be analyzed, i.e. a set system over a set of players. In many situations the author will work in a closure space. Examples of closure operators are the spanning operator of linear algebra and all convex hull operators. Chapters 1-4 constitute a review of mathematical concepts from Cooperative Game Theory, Graph Theory, Linear and Integer Programming, Combinatorial Optimization, Discrete Convex Analysis and Computational Complexity. The table of contents is a short guide to the topics and methods covered in this book. In Chapters 11 and 12, several notebooks are presented with the system Mathematica by Wolfram in the contexts of the packages DiscreteMath (Skiena) and Cooperative (Carter). There will also be found in the book several research projects. These are intended to offer new ideas that the reader should consider with caution. This book will be of interest to graduate students with some experience in game theory or mathematical programming and professional researchers in game theory, operational research and its applications in economic theory, and the political and social sciences. In addition, it will be especially useful for professionals who are interested in models for understanding and managing conflicts: management and operational research scientists, political and military scientists, and professional negotiators.

Author: Imma Curiel
Publisher: Springer Science & Business Media
ISBN: 147574871X
Category : Business & Economics
Languages : en
Pages : 198

View

Book Description
In this book applications of cooperative game theory that arise from combinatorial optimization problems are described. It is well known that the mathematical modeling of various real-world decision-making situations gives rise to combinatorial optimization problems. For situations where more than one decision-maker is involved classical combinatorial optimization theory does not suffice and it is here that cooperative game theory can make an important contribution. If a group of decision-makers decide to undertake a project together in order to increase the total revenue or decrease the total costs, they face two problems. The first one is how to execute the project in an optimal way so as to increase revenue. The second one is how to divide the revenue attained among the participants. It is with this second problem that cooperative game theory can help. The solution concepts from cooperative game theory can be applied to arrive at revenue allocation schemes. In this book the type of problems described above are examined. Although the choice of topics is application-driven, it also discusses theoretical questions that arise from the situations that are studied. For all the games described attention will be paid to the appropriateness of several game-theoretic solution concepts in the particular contexts that are considered. The computation complexity of the game-theoretic solution concepts in the situation at hand will also be considered.

Author: Georgios Chalkiadakis
Publisher: Morgan & Claypool Publishers
ISBN: 1608456528
Category : Computers
Languages : en
Pages : 171

View

Book Description
Cooperative game theory is a branch of (micro-)economics that studies the behavior of self-interested agents in strategic settings where binding agreements among agents are possible. Our aim in this book is to present a survey of work on the computational aspects of cooperative game theory. We begin by formally defining transferable utility games in characteristic function form, and introducing key solution concepts such as the core and the Shapley value. We then discuss two major issues that arise when considering such games from a computational perspective: identifying compact representations for games, and the closely related problem of efficiently computing solution concepts for games. We survey several formalisms for cooperative games that have been proposed in the literature, including, for example, cooperative games defined on networks, as well as general compact representation schemes such as MC-nets and skill games. As a detailed case study, we consider weighted voting games: a widely-used and practically important class of cooperative games that inherently have a natural compact representation. We investigate the complexity of solution concepts for such games, and generalizations of them. We briefly discuss games with non-transferable utility and partition function games. We then overview algorithms for identifying welfare-maximizing coalition structures and methods used by rational agents to form coalitions (even under uncertainty), including bargaining algorithms. We conclude by considering some developing topics, applications, and future research directions.

Author: Elliott Mendelson
Publisher: CRC Press
ISBN: 104009189X
Category : Mathematics
Languages : en
Pages : 342

View

Book Description
This classic text, originally from the noted logician Elliot Mendelson, is intended to be an easy-to-read introduction to the basic ideas and techniques of game theory. It can be used as a class textbook or for self-study. Introducing Game Theory and its Applications, Second Edition presents an easy-to-read introduction to the basic ideas and techniques of game theory. After a brief introduction, the authors begin with a chapter devoted to combinatorial games--a topic neglected or treated minimally in most other texts. The focus then shifts to two-person zero-sum games and their solutions. Here the authors present the simplex method based on linear programming for solving these games and develop within this presentation the required background. The final chapter presents some of the fundamental ideas and tools of non-zero-sum games and games with more than two players, including an introduction to cooperative game theory. The book is suitable for a first undergraduate course in game theory, or a graduate course for students with limited previous exposure. It is useful for students who need to learn some game theory for a related subject (e.g., microeconomics) and have a limited mathematical background. It also prepares its readers for more advanced study of game theory's applications in economics, business, and the physical, biological, and social sciences. The authors hope this book breeds curiosity about the subject as its design is meant to to satisfy the readers. The book will prepare readers for deeper study of game theory applications in many fields of study.

Author: Elliott Mendelson
Publisher: CRC Press
ISBN: 9781584883005
Category : Mathematics
Languages : en
Pages : 274

View

Book Description
The mathematical study of games is an intriguing endeavor with implications and applications that reach far beyond tic-tac-toe, chess, and poker to economics, business, and even biology and politics. Most texts on the subject, however, are written at the graduate level for those with strong mathematics, economics, or business backgrounds. In a clear and refreshing departure from this trend, Introducing Game Theory and its Applications presents an easy-to-read introduction to the basic ideas and techniques of game theory. After a brief introduction, the author begins with a chapter devoted to combinatorial games--a topic neglected or treated minimally in most other texts. The focus then shifts to two-person zero-sum games and their solution. Here the author presents the simplex method, based on linear programming, for solving these games and develops within his presentation the required background in linear programming. The final chapter presents some of the fundamental ideas and tools of non-zero-sum games and games with more than two players, including an introduction to cooperative game theory. This book will not only satisfy the curiosity of those whose interest in the subject was piqued by the 1994 Nobel Prize awarded to Harsanyi, Nash, and Selten. It also prepares its readers for more advanced study of game theory's applications in economics, business, and the physical, biological, and social sciences.

Author: Francisco Javier Muros
Publisher: Springer
ISBN: 3030104893
Category : Technology & Engineering
Languages : en
Pages : 233

View

Book Description
This book analyzes coalitional control schemes by incorporating concepts of cooperative game theory into a distributed control framework. It considers a networked architecture where the nodes are the agents and the edges are their communication links and either the agents or the links are established as the players of cooperative games related to the cost function of the coalitional schemes. The book discusses various cooperative game theory tools that are used to measure/analyze the players’ features, impose constraints on them, provide alternative methods of game computation, detect critical players inside the control scheme, and perform system partitioning of large-scale systems, such as the Barcelona drinking water network, which is described in a case study.

Author: Aaron N. Siegel
Publisher: American Mathematical Society
ISBN: 1470475685
Category : Mathematics
Languages : en
Pages : 541

View

Book Description
It is wonderful to see advanced combinatorial game theory made accessible. Siegel's expertise and enjoyable writing style make this book a perfect resource for anyone wanting to learn the latest developments and open problems in the field. —Erik Demaine, MIT Aaron Siegel has been the major contributor to Combinatorial Game Theory over the last decade or so. Now, in this authoritative work, he has made the latest results in the theory accessible, so that the subject will achieve the place in mathematics that it deserves. —Richard Guy, University of Calgary Combinatorial game theory is the study of two-player games with no hidden information and no chance elements. The theory assigns algebraic values to positions in such games and seeks to quantify the algebraic and combinatorial structure of their interactions. Its modern form was introduced thirty years ago, with the publication of the classic Winning Ways for Your Mathematical Plays by Berlekamp, Conway, and Guy, and interest has rapidly increased in recent decades. This book is a comprehensive and up-to-date introduction to the subject, tracing its development from first principles and examples through many of its most recent advances. Roughly half the book is devoted to a rigorous treatment of the classical theory; the remaining material is an in-depth presentation of topics that appear for the first time in textbook form, including the theory of misère quotients and Berlekamp's generalized temperature theory. Packed with hundreds of examples and exercises and meticulously cross-referenced, Combinatorial Game Theory will appeal equally to students, instructors, and research professionals. More than forty open problems and conjectures are mentioned in the text, highlighting the many mysteries that still remain in this young and exciting field. Aaron Siegel holds a Ph.D. in mathematics from the University of California, Berkeley and has held positions at the Mathematical Sciences Research Institute and the Institute for Advanced Study. He was a partner at Berkeley Quantitative, a technology-driven hedge fund, and is presently employed by Twitter, Inc.

Author: Rodica Branzei
Publisher: Springer Science & Business Media
ISBN: 354077954X
Category : Business & Economics
Languages : en
Pages : 203

View

Book Description
Cooperative game theory is a booming research area with many new developments in the last few years. So, our main purpose when prep- ing the second edition was to incorporate as much of these new dev- opments as possible without changing the structure of the book. First, this o?ered us the opportunity to enhance and expand the treatment of traditional cooperative games, called here crisp games, and, especially, that of multi-choice games, in the idea to make the three parts of the monograph more balanced. Second, we have used the opportunity of a secondeditiontoupdateandenlargethelistofreferencesregardingthe threemodels of cooperative games. Finally, we have bene?ted fromthis opportunity by removing typos and a few less important results from the ?rst edition of the book, and by slightly polishing the English style and the punctuation, for the sake of consistency along the monograph. The main changes are: (1) Chapter 3 contains an additional section, Section 3. 3, on the - erage lexicographic value, which is a recent one-point solution concept de?ned on the class of balanced crisp games. (2) Chapter 4 is new. It o?ers a brief overview on solution c- cepts for crisp games from the point of view of egalitarian criteria, and presents in Section 4. 2 a recent set-valued solution concept based on egalitarian considerations, namely the equal split-o? set. (3)Chapter5isbasicallyanenlargedversionofChapter4ofthe?rst edition because Section 5. 4 dealing with the relation between convex games and clan games with crisp coalitions is new.

Author: Michael Albert
Publisher: CRC Press
ISBN: 1439864373
Category : Mathematics
Languages : en
Pages : 298

View

Book Description
Combinatorial games are games of pure strategy involving two players, with perfect information and no element of chance. Starting from the very basics of gameplay and strategy, the authors cover a wide range of topics, from game algebra to special classes of games. Classic techniques are introduced and applied in novel ways to analyze both old and