Social Choice Under Incomplete, Cyclic Preferences
Jobst Heitzig
Abstract
Actual individual preferences are neither complete (=total) nor antisymmetric in general, so that at least every quasi-order must be an admissible input to a satisfactory choice rule. It is argued that the traditional notion of ``indifference'' in individual preferences is misleading and should be replaced by `equivalence' and `undecidedness'. In this context, ten types of majority and minority arguments of different strength are studied which lead to social choice rules that accept profiles of arbitrary reflexive relations. These rules are discussed by means of many familiar, and some new conditions, including `immunity from binary arguments'. Moreover, it is proved that every choice function satisfying two weak Condorcet-type conditions can be made both composition-consistent and idempotent, and that all the proposed rules have polynomial time complexity.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.