Cores and capacities of compound simple games
From MaRDI portal
We provide an exact formula for the Nakamura number of a compound simple game. Also, we investigate the capacity of compound games. In particular, we show that if the components are not weak, then the capacity of the compound game is 2.
Recommendations
Cites work
- scientific article; zbMATH DE number 3867093 (Why is no real title available?)
- scientific article; zbMATH DE number 3898540 (Why is no real title available?)
- scientific article; zbMATH DE number 3205077 (Why is no real title available?)
- The capacity of a committee
- The vetoers in a simple game with ordinal preferences
Cited in
(9)- A note on the core and von Neumann-Morgenstern solutions of simple games
- Approximate cores of games and economies with clubs.
- Precise complexity of the core in dichotomous and additive hedonic games
- Bounds for the Nakamura number
- Analysis of a simple capacity game
- scientific article; zbMATH DE number 177097 (Why is no real title available?)
- scientific article; zbMATH DE number 3205077 (Why is no real title available?)
- scientific article; zbMATH DE number 5034462 (Why is no real title available?)
- Decomposition of games with non-empty core into veto-controlled simple games
This page was built for publication: Cores and capacities of compound simple games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098789)