Abstract:
Two problems are discussed in studying the collective choice operators which arrange the resultant binary relations with reference to original binary relations. Such operators are explicitly represented by using set theoretic operations of union, intersection, and lexicographic product with original relations. Operators neutral vis-a-vis the electors are described and conditions are provided under which such operators arrange acyclic resultant relations.