We assume that people have a need to make statements, and construct a model in which this need is the sole determinant of voting behavior. In this model, an individual selects a ballot that makes as close a statement as possible to her ideal point, where abstaining from voting is a possible (null) statement. We show that in such a model, a political system that adopts approval voting may be expected to enjoy a signiﬁcantly higher rate of participation in elections than a comparable system with plurality rule.
People may be surprised by noticing certain regularities that hold in existing knowledge they have had for some time. That is, they may learn without getting new factual information. We argue that this can be partly explained by computational complexity. We show that, given a database, ﬁnding a small set of variables that obtain a certain value of R2 is computationally hard, in the sense that this term is used in computer science. We discuss some of the implications of this result and of fact-free learning in general.
Keywords: Computational complexity, Linear regression, Rule-based reasoning