Parliament dynamics might seem erratic at times. Predicting future voting patterns could support policy design based on the simulation of voting scenarios. The availability of open data on legislative activities and machine learning tools might enable such ...
Poor decisions and selfish behaviors give rise to seemingly intractable global problems, such as the lack of transparency in democratic processes, the spread of conspiracy theories, and the rise in greenhouse gas emissions. However, people are more predict ...
We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for n-sided dice with pairwise ordering induced by the probability, relative to 1/2, that a throw from one die is higher than the other. We ...
Studies on preferences for environmental quality usually posit that price and income explain most of the observed choices. However, we argue that conceptions of social norms and the common good are equally important when analyzing environmental voting outc ...
Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the voting process on the ...
A networked set of agents holding binary opinions does not seem to be able to compute its majority opinion by means of local binary interactions only. However, the majority problem can be solved using two or more bits, instead of one [1]. Pairs of agents a ...
We show how to express an arbitrary integer interval I=[0,H] as a sumset I=∑i=1ℓGi∗[0,u−1]+[0,H′] of smaller integer intervals for some small values ℓ, u, and H′<u−1, where b∗A={ba:a∈A} and $A + B = ...
We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Instead, our algorithm reaches consensus on the quantized interval that contains ...
