This paper studies the problem of majority-rule-based collective decision-making where the agents’ preferences are represented by CP-nets (Conditional Preference Networks). As there are exponentially many alternatives, it is impractical to reason about the individual full rankings over the alternative space and apply majority rule directly. Most existing works either do not consider computation...

Social choice theory shows that majority rule is generically unstable. Contrary to this theoretical prediction, however, large policy shifts are rare events in politics. Hence, why is majority rule stable? The uncovered set is the dominant preference-based explanation for the stability of majority rule. Its underlying logic assumes that voters act strategically considering the ultimate conseque...

The combination of forecasts resulting from an ensemble of neural networks has been shown to outperform the use of a single “best” network model. This is supported by an extensive body of literature, which shows that combining generally leads to improvements in forecasting accuracy and robustness, and that using the mean operator often outperforms more complex methods of combining forecasts. Th...

Following the seminal work of M. Culler and P. Shalen [Culler & Shalen, 1983], and that of A. Casson [Akbulut & McCarthy, 1990], the theory of representation and character varieties of 3-manifolds has come to be recognized as a powerful tool, and has duly assumed an important place in low-dimensional topology. Among the many papers that have appeared in this context, we mention [Culler et al., ...

Some binary linear codes of length 50 and 100 are constructed using the adjacency matrices of the Hooman-Singleton graph and the Higman-Sims graph. Some of the codes are optimal or nearly optimal for the given length and dimension. The dual codes admit majority logic decoding.

The k-majority game is played with n numbered balls, each coloured with one of two colours. It is given that there are at least k balls of the majority colour, where k is a fixed integer greater than n/2. On each turn the player selects two balls to compare, and it is revealed whether they are of the same colour; the player’s aim is to determine a ball of the majority colour. It has been correc...

Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC, and raised as an open question if similar (or stronger) lower bounds could be proved for the set of prime numbers. In this note, we show that the Boolean majority function is AC-Turing reducible to the set of prime numbers (represented in binary). From known lower bounds on Maj (due to Razbo...