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

algorithmcluttersimple gamesmallest committee

Mathematics Subject Classification ID

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

Review text

Let N be a finite set and T a nonempty subset of N. The paper proposes an algorithm to find the smallest committee containing T. This algorithm is a modification of a previous one proposed by \textit{L. J. Billera} [J. Comb. Theory B 11, 234-245 (1971; Zbl 0219.90068)].

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

(4)

• 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
• scientific article; zbMATH DE number 1043902 (Why is no real title available?)

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)