The plurality problem with three colors and more.
DOI10.1016/J.TCS.2004.12.035zbMATH Open1107.90025OpenAlexW1972715414MaRDI QIDQ557833FDOQ557833
Authors: Martin Aigner, Gianluca De Marco, Manuela Montangero 
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.035
Recommendations
Permutations, words, matrices (05A05) Analysis of algorithms (68W40) Search theory (90B40) Microeconomic theory (price theory and economic markets) (91B24) Combinatorial games (91A46)
Cites Work
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- On computing majority by comparisons
- Variants of the majority problem.
- Search for a majority element
- Determining the majority
- Title not available (Why is that?)
- The worst-case chip problem
- The Average-Case Complexity of Determining the Majority
- STACS 2004
- Mathematical Foundations of Computer Science 2003
Cited In (16)
- Adaptive majority problems for restricted query graphs and for weighted sets
- How to play the majority game with a liar
- Computing majority via multiple queries
- Randomized strategies for the plurality problem
- Probabilistic strategies for the partition and plurality problems
- The majority game with an arbitrary majority
- STACS 2004
- A plurality problem with three colors and query size three
- Computing and Combinatorics
- Finding non-minority balls with majority and plurality queries
- Adaptive majority problems for restricted query graphs and for weighted sets
- Searching for majority with \(k\)-tuple queries
- From discrepancy to majority
- Determining plurality
- STACS 2005
- Majority problems of large query size
This page was built for publication: The plurality problem with three colors and more.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557833)
