An algorithm to find the smallest committee containing a given set

MaRDI QIDQ1080373zbMATH OpenFDO

Authors B. George

Publication date 1986

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

algorithmsimple gamecluttersmallest committee

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Game theory (91A99)

Recommendations

• scientific article; zbMATH DE number 1043902
• Committees of systems of linear inequalities
• A new algorithm to find the smallest committee containing a given set of players
• Solving of optimization and identification problems by the committee methods
• scientific article; zbMATH DE number 3847212

Cited in

(3)

• A new algorithm to find the smallest committee containing a given set of players
• Preface: International conference on game theory and optimization, June 6--10, 2016, Indian Institute of Technology Madras, Chennai, India
• The complexity of modular decomposition of Boolean functions

This page was built for publication: An algorithm to find the smallest committee containing a given set

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