A new algorithm to find the smallest committee containing a given set of players

MaRDI QIDQ1102212zbMATH OpenFDO

Authors K. G. Ramamurthy

Publication date 1988

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

distinct minimal winning coalitionssimple gamesmallest committee

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12)

Recommendations

• An algorithm to find the smallest committee containing a given set
• scientific article; zbMATH DE number 1043902
• Faster algorithms for computing power indices in weighted voting games
• The weighted majority game
• Computing the minimal covering set

Cited in

(2)

• An algorithm to find the smallest committee containing a given set
• scientific article; zbMATH DE number 1043902 (Why is no real title available?)

This page was built for publication: A new algorithm to find the smallest committee containing a given set of players

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102212)