Cooperative Games on Combinatorial Structures, Softcover reprint of the original 1st ed. 2000 Theory and Decision Library C Series, Vol. 26

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 Gamesand 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 IntegerProgramming, 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.

Preface. 1. Structures. 2. Linear optimization methods. 3. Discrete convex analysis. 4. Computational complexity. 5. Restricted games by partition systems. 6. Restricted games by union stable systems. 7. Values for games on convex geometries. 8. Values for games on matroids. 9. The core, the selectope and the Weber set. 10. Simple games on closure spaces. 11. Voting power. 12. Computing values with Mathematica. Bibliography. Index.