Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets

  title={Adaptive Majority Problems for Restricted Query Graphs and for Weighted Sets},
  author={G{\'a}bor Dam{\'a}sdi and D{\'a}niel Gerbner and Gyula O. H. Katona and Bal{\'a}zs Keszegh and D{\'a}niel Lenger and Abhishek Methuku and D{\'a}niel T. Nagy and D{\"o}m{\"o}t{\"o}r P{\'a}lv{\"o}lgyi and Bal{\'a}zs Patk{\'o}s and M{\'a}t{\'e} Vizer and G{\'a}bor Wiener},
  journal={Discret. Appl. Math.},



Computing majority via multiple queries

From Discrepancy to Majority

We show how to select an item with the majority color from n two-colored items, given access to the items only through an oracle that returns the discrepancy of subsets of k items (the absolute value

Majority problems of large query size

Randomized Algorithms for Determining the Majority on Graphs

Lower bounds are shown showing that some simple and natural algorithms for this problem cannot be improved in general.

A plurality problem with three colors and query size three

Oblivious and Adaptive Strategies for the Majority and Plurality Problems

This paper establishes a linear upper bound for the Majority problem with arbitrarily many different colors assuming a majority label exists, and shows that the Plurality problem is significantly more difficult by establishing quadratic lower and upper bounds.

Variants of the majority problem

Majority and Plurality Problems