In this paper, we study, mathematically speaking, the problem-the number of admissible preference orderings for the transitivity of simple majority vote(SMV) derived from Arrow’s Impossibility Theorem. In our researc...In this paper, we study, mathematically speaking, the problem-the number of admissible preference orderings for the transitivity of simple majority vote(SMV) derived from Arrow’s Impossibility Theorem. In our research, we find, by computer enumerating, that some results given by Craven are not correct. By defining a set of constraints, we give the recurrence formula of the local maximal number of admissible preference orderings and some other useful results.展开更多
基金This project is supported by Doctoral Fundation of National Educational Committee.
文摘In this paper, we study, mathematically speaking, the problem-the number of admissible preference orderings for the transitivity of simple majority vote(SMV) derived from Arrow’s Impossibility Theorem. In our research, we find, by computer enumerating, that some results given by Craven are not correct. By defining a set of constraints, we give the recurrence formula of the local maximal number of admissible preference orderings and some other useful results.
