To examine the consequences of allowing individual to violate full rationality in collective decision making, this article discusses the possibility of aggregating quasi-transitive preferences in the Arrovian framework. Quasi-transitive valued aggregating functions are discussed and...

Introduction -- Elementary Logic -- Sets, Relations, Functions -- Binary Relations -- Social Choice Theoretic Framework and Arrow Impossibility Theorem -- Some Important Value-Judgments, Rules and Theorems -- Implications of Weakening of Some of Arrow Conditions -- The Method of Majority...

We consider situations in which agents are notable to completely distinguish between all alternatives. Preferences respect individual objective indifferences if any two alternatives are indifferent whenever an agent cannot distinguish between them. We present necessary and sufficient conditions...

We consider situations in which agents are not able to completely distinguish between all alternatives. Preferences respect individual objective indifferences if any two alternatives are indifferent whenever an agent cannot distinguish between them. We present necessary and sufficient conditions...

We examine properties of binary relations that complement quasi-transitivity and Suzumura consistency in the sense that they, together with the original axiom(s), are equivalent to transitivity. In general, the conjunction of quasi-transitivity and Suzumura consistency is strictly weaker than...

We consider situations in which agents are notable to completely distinguish between all alternatives. Preferences respect individual objective indifferences if any two alternatives are indifferent whenever an agent cannot distinguish between them. We present necessary and sufficient conditions...

We consider situations in which agents are not able to completely distinguish between all alternatives. Preferences respect individual objective indifferences if any two alternatives are indifferent whenever an agent cannot distinguish between them. We present necessary and sufficient conditions...

We examine properties of binary relations that complement quasi-transitivity and Suzumura consistency in the sense that they, together with the original axiom(s), are equivalent to transitivity. In general, the conjunction of quasi-transitivity and Suzumura consistency is strictly weaker than...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...