Coherent structures and simple games
A simple mathematical structure has been studied under a variety of names. This structure is the following. Let \(N\) be a finite set. The structure is given by a family \(\mathcal P\) of subsets of \(N\) satisfying (i) \(\phi\not\in{\mathcal P}\), (ii) \(N\in{\mathcal P}\) and (iii) \(S\subseteq T\) and \(S\in{\mathcal P}\) imply that \(T\in{\mathcal P}\). Such a structure is known among other names as ``coherent structure of reliability theory and as ``simple game. The main objective of this book is to unify some of the concepts in reliability theory and in simple games. The first chapter is devoted to the coherent structure of reliability theory and the second deals with simple games. In chapter 2 the conceptual equivalence of semi-coherent structures of reliability and simple games is studied. In chapter 3, the analogy between the importance of components in reliability and the power index of a player is analyzed. It should be noted that the indices of Shapley-Shubik and of Banzhaf were discovered some 20 years before the analogous concepts in reliability theory. In chapter 4, entitled ``Modules and Modular Sets, a number of original results on simple games due to the author in collaboration with T. Parthasarathy are provided. In the terminology of game theory these modules and modular sets are committees and family of committees. The last chapter gives a proof of Arrow's impossibility theorem using simple games and follows \textit{R. B. Wilson's} somewhat neglected paper [J. Econ. Theory 5, 14-20 (1972)]. The overall presentation is clear and game-theorists are likely to benefit from reading it. What is also refreshing is that, after all, cooperative game theory is still alive. The reviewer has, however, a small regret. Nakamura's analysis about the non-emptiness of the core linking the number of options with a number derived from the simple game structure is not even mentioned.
- On the fractional chromatic number of monotone self-dual Boolean functions
- Fundamentals of simple games from a viewpoint of blockability relations
- Transversality of the Shapley value
- A generalization of the three modules theorem
- Positive and Horn decomposability of partially defined Boolean functions
- Error-free and best-fit extensions of partially defined Boolean functions
- Interior and exterior functions of positive Boolean functions.
- Convexity and logical analysis of data
- Voting fairly: Transitive maximal intersecting families of sets
- Logical analysis of binary data with missing bits
- On the characterization of weighted simple games
- On the inference of semi-coherent structures from data
- Dual-bounded generating problems: Weighted transversals of a hypergraph
- Quasi-clusterability of signed graphs with negative self evaluation
- Simple games and magic squares
- Decomposability of partially defined Boolean functions
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- Inner-core and outer-core functions of partially defined Boolean functions
- On the enumeration of bipartite simple games
- Aggregation and signature based comparisons of multi-state systems via decompositions of fuzzy measures
- On the enumeration of Boolean functions with distinguished variables
- Operation comfort of multistate system vs. the importance of its components
- On the probabilistic meaning of copula-based extensions of fuzzy measures. Applications to target-based utilities and multi-state reliability systems
- A method to compare influence of coalitions on group decision other than desirability relation
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
- The complexity of modular decomposition of Boolean functions
- On minimum integer representations of weighted games
- Bounds for \(| W^ m\cup B^ m| \) for simple games.
- Dimension of complete simple games with minimum
- Cooperation through social influence
- Cooperative games with a simplicial core
- Multi-attribute target-based utilities and extensions of fuzzy measures
- A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
- Algorithms and Formulae for Conversion Between System Signatures and Reliability Functions
- Representations of component importance for coherent systems with exchangeable components
- Subsignatures of systems
- Generating dual-bounded hypergraphs
- Symmetric approximations of pseudo-Boolean functions with applications to influence indexes
- Computing subsignatures of systems with exchangeable component lifetimes
- The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
- Algorithms for k-meet-semidistributive lattices
- Near coherence and filter games
- A note about games-composition dimension
- Social disruption games in signed networks
- Signed graphs with negative self evaluation and clusterability of graphs
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry
- A global parallel algorithm for the hypergraph transversal problem
- Self-consistency of decision rules for group decision making
- The class of microarray games and the relevance index for genes
- On the complexity of monotone dualization and generating minimal hypergraph transversals
This page was built for publication: Coherent structures and simple games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3997892)