Determining the majority: The biased case
From MaRDI portal
Recommendations
- Determining the majority
- Yet another characterization of the majority rule
- The (sub-)optimality of the majority rule
- From discrepancy to majority
- From discrepancy to majority
- The worst case for decision-making by a majority vote
- Biased experts, majority rule, and the optimal composition of committee
- The consistency of majority rule
Cites work
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- A parallel fault identification algorithm
- An adaptive algorithm for system level diagnosis
- Average case selection
- Determining the majority
- On computing majority by comparisons
- Optimality of move-to-front for self-organizing data structures with locality of references
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- The Average-Case Complexity of Determining the Majority
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Generating all combinations and partitions. Fasc. 4: Generating all trees. History of combinatorial generation.
- The average complexity of a coin-weighing problem
Cited in
(4)
This page was built for publication: Determining the majority: The biased case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364402)