In this paper, we present a model of deliberation based on Rawls’s political liberalism. Our formalization gives a new perspective on his political theory. Moreover, we obtain quantitative results on political deliberation under Rawlsian rules. Finally, we elaborate two arguments in favor of...

A social welfare function for a denumerable society satisfies {Pairwise Computability} if for each pair (x,y) of alternatives, there exists an algorithm that can decide from any description of each profile on {x,y} whether the society prefers x to y. I prove that if a social welfare function...

The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games, strengthens the earlier result that computable games violate...

The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively study the restrictions that various properties for a simple...

Classify simple games into sixteen “types” in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and algorithmic computability. For each such class,...

Recommendation systems are at the core of Web 2.0 acting like “virtual” salespersons, which collaboratively filter and propose products to consumers of Web stores. This article, investigates the Amazon co-purchase network, which is formed by every recommendation of the top selling products...