A Course On Cooperative Game Theory

"Deals with real life situations where objectives of the participants are partially cooperative and partially conflicting"--

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.

The book brings together an overview of standard concepts in cooperative game theory with applications to the analysis of social networks and hierarchical authority organizations. The standard concepts covered include the multi-linear extension, the Core, the Shapley value, and the cooperative potential. Also discussed are the Core for a restricted collection of formable coalitions, various Core covers, the Myerson value, value-based potentials, and share potentials. Within the context of social networks this book discusses the measurement of centrality and power as well as allocation rules such as the Myerson value and hierarchical allocation rules. For hierarchical organizations, two basic approaches to the exercise of authority are explored; for each approach the allocation of the generated output is developed. Each chapter is accompanied by a problem section, allowing this book to be used as a textbook for an advanced graduate course on game theory.

This book systematically presents the main solutions of cooperative games: the core, bargaining set, kernel, nucleolus, and the Shapley value of TU games as well as the core, the Shapley value, and the ordinal bargaining set of NTU games. The authors devote a separate chapter to each solution, wherein they study its properties in full detail. In addition, important variants are defined or even intensively analyzed.

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.

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.

This book introduces new concepts for cooperative game theory, and particularly solutions that determine the distribution of a coalitional surplus among the members of the coalition. It also addresses several generalizations of cooperative game theory. Drawing on methods of welfare economics, new value solutions are derived for Non-Transferable Utility games with and without differences of bargaining power among the members of the coalition. Cooperation in intertemporal games is examined, and conditions that permit the reduction of these games to games in coalition function form are outlined. Biform games and games that combine non-cooperative search and matching of coalition members with cooperative solutions (i.e., efficient contracts) within the coalition are considered. Contents:Value Solutions for Superadditive Transferable Utility Games in Coalition Function FormZeuthen–Nash BargainingNontransferable Utility Games and Games in Partition Function FormA Shapley Value Algorithm for Games in Partition Function FormExtension of the Nucleolus to Nontransferable Utility Games in Partition Function FormA Core Imputation with Variable Bargaining PowerBargaining Power Biform GamesIntertemporal Cooperative Games: A Sketch of a TheoryA Theory of Enterprise Readership: Graduate students and researchers in the field of game theory. Keywords:Cooperative Games;Value;Imputation;Bargaining TheoryKey Features:Proposes a value solution for games of two or more players that: (i) is the Nash bargaining solution in a special case, (ii) allows for unsymmetrical bargaining power, (iii) allows for group-to-group bargaining, and (iv) is always a point in the core of the game if the game is not nullUses methods from mathematical welfare economics to bridge the gap from non-transferable utility to transferable utilityRelying on Biform Games (Brandenburger and Stuart), constructs a model of cooperative value creation in coalitions formed by non-cooperative search and matching

This is a textbook for university juniors, seniors, and graduate students majoring in economics, applied mathematics, and related fields. Each chapter is structured so that a core concept of that chapter is presented with motivations, useful applications are given, and related advanced topics are discussed for future study. Many helpful exercises at various levels are provided at the end of each chapter. Therefore, this book is most suitable for readers who intend to study non-cooperative game theory rigorously for both theoretical studies and applications. Game theory consists of non-cooperative games and cooperative games. This book covers only non-cooperative games, which are major tools used in current economics and related areas. Non-cooperative game theory aims to provide a mathematical prediction of strategic choices by decision makers (players) in situations of conflicting interest. Through the logical analyses of strategic choices, we obtain a better understanding of social (economic, business) problems and possible remedies. The book contains many well-known games such as the prisoner’s dilemma, chicken (hawk–dove) game, coordination game, centipede game, and Cournot, Bertrand, and Stackelberg models in oligopoly. It also covers some advanced frameworks such as repeated games with non-simultaneous moves, repeated games with overlapping generations, global games, and voluntarily separable repeated prisoner’s dilemma, so that readers familiar with basic game theory can expand their knowledge. The author’s own research is reflected in topics such as formulations of information and evolutionary stability, which makes this book unique.