Regular simple games
From MaRDI portal
Publication:1123143
DOI10.1007/BF01268159zbMath0676.90103MaRDI QIDQ1123143
Publication date: 1989
Published in: International Journal of Game Theory (Search for Journal in Brave)
finitely additive probability measuresimple gamesintersection numberwinning coalitionscounting vectorlosing coalitionsstrongly regular games
Related Items (15)
Coalitional desirability and the equal division value ⋮ Representation-compatible power indices ⋮ Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces ⋮ Different ways to represent weighted majority games ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Directed and weighted majority games ⋮ On the characterization of weighted simple games ⋮ On the enumeration of some inequivalent monotone Boolean functions ⋮ The geometry of voting power: weighted voting and hyper-ellipsoids ⋮ Winning coalitions in plurality voting democracies ⋮ Ordinal aggregation and quantiles ⋮ On the enumeration of bipartite simple games ⋮ Complete simple games ⋮ A critical analysis on the notion of power ⋮ On a representation of a relation by a measure
Cites Work
- Unnamed Item
- Measures on Boolean algebras
- The desirability relation of simple games
- Large symmetric games are characterized by completeness of the desirability relation
- A characterization, existence proof and dimension bounds for the kernel of a game
- Mathematical Properties of the Banzhaf Power Index
- The Counting Vector of a Simple Game
- Chow Parameters in Threshold Logic
This page was built for publication: Regular simple games