A new algorithm to find the smallest committee containing a given set of players (Q1102212)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4049435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm to find the smallest committee containing a given set of players |
scientific article; zbMATH DE number 4049435 |
Statements
A new algorithm to find the smallest committee containing a given set of players (English)
0 references
1988
0 references
smallest committee
0 references
simple game
0 references
distinct minimal winning coalitions
0 references
0.8039265871047974
0 references
0.7931342124938965
0 references
0.7111952900886536
0 references
0.7094674706459045
0 references
