Abstract
Single-Peaked preferences play an important role in the social choice literature. In this paper, we look at necessary and sufficient conditions for aggregated choices to be consistent with a mixture model of single-peaked preferences for a given ordering of the alternatives. These conditions can be tested in time polynomial in the number of choice alternatives. In addition, algorithms are provided which identify the underlying ordering of choice alternatives if the ordering is unknown. These algorithms also run in polynomial time, providing an efficient test for the mixture model of single-peaked preferences.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
