Testing a Mixture Model of Single-Peaked Preferences

[en] 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.

Disciplines :

Microeconomics

Author, co-author :

Smeulders, Bart ; Université de Liège - ULiège > HEC Liège : UER > Recherche opérationnelle et gestion de la production

Language :

English

Title :

Testing a Mixture Model of Single-Peaked Preferences

Publication date :

2018

Journal title :

Mathematical Social Sciences

ISSN :

0165-4896

Publisher :

Elsevier, Netherlands

Volume :

Pages :

101-113

Peer reviewed :

Peer Reviewed verified by ORBi

Available on ORBi :

since 20 February 2018

Statistics

Number of views

100 (6 by ULiège)

Number of downloads

152 (0 by ULiège)

More statistics

Scopus citations^®

Scopus citations^®
without self-citations

OpenCitations

OpenAlex citations

Bibliography

Ballester, M., Haeringer, G., A characterization of the single-peaked domain. Soc. Choice Welf. 36:2 (2011), 305–322.
Bartholdi, J., Trick, M., Stable matching with preferences derived from a psychological model. Oper. Res. Lett. 5:4 (1986), 165–169.
Black, D., On the rationale of group decision-making. J. Polit. Econ., 56(1), 1948, 23.
Block, H.D., Marschak, J., Random orderings and stochastic theories of responses. Contributions To Probability and Statistics, Vol. 2, 1960, 97–132.
Booth, K., Lueker, G., Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci. 13:3 (1976), 335–379.
Bredereck, R., Chen, J., Woeginger, G., Are there any nicely structured preference profiles nearby?. Math. Social Sci. 79 (2016), 61–73.
Christophe, J., Doignon, J.P.L., Fiorini, S.L., The biorder polytope. Order 21:1 (2004), 61–82.
Davis-Stober, C., A lexicographic semiorder polytope and probabilistic representations of choice. J. Math. Psych. 56:2 (2012), 86–94.
Davis-Stober, C., Park, S., Brown, N., Regenwetter, M., Reported violations of rationality may be aggregation artifacts. Proc. Natl. Acad. Sci. 113:33 (2016), E4761–E4763.
Doignon, J., Falmagne, J., A polynomial time algorithm for unidimensional unfolding representations. J. Algorithms 16:2 (1994), 218–233.
Dridi, T., Surles distributions binaires associées à des distributions ordinales. Math. Sci. Hum. 69 (1980), 15–31.
Dridi, T., Distributions binaires unimodales. Discrete Math. 126:1–3 (1994), 373–378.
Elkind, E., Faliszewski, P., 2014. Recognizing 1-euclidean preferences: An alternative approach. In: SAGT.
Erdélyi, G., Lackner, M., Pfandler, A., Computational aspects of nearly single-peaked electorates. Proceedings of the 27th AAAI Conference on Artificial Intelligence, (AAAI 2013), 2013, AAAI Press, 283–289.
Escoffier, B., Lang, J., Öztürk, M., 2008. Single-peaked consistency and its complexity. In: ECAI, Vol. 8, pp. 366–370.
Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L., The complexity of manipulative attacks in nearly single-peaked electorates. Artificial Intelligence 207 (2014), 69–99.
Fiorini, S., 0, 1/2-cuts and the linear ordering problem: Surfaces that define facets. SIAM J. Discrete Math. 20:4 (2006), 893–912.
Fiorini, S., Fishburn, P.C., Weak order polytopes. Discrete Math. 275:1 (2004), 111–127.
Knoblauch, V., Recognizing one-dimensional Euclidean preference profiles. J. Math. Econom. 46:1 (2010), 1–5.
List, C., Luskin, R., Fishkin, J., McLean, I., Deliberation, single-peakedness, and the possibility of meaningful democracy: evidence from deliberative polls. J. Polit. 75:01 (2013), 80–95.
Luce, D., A probabilistic theory of utility. Econometrica 26 (1958), 193–224.
Martí R., Reinelt, G., Antman, S.S., Marsden, J.E., Sirovich, L., (eds.) The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization Applied Mathematical Sciences, vol. 175, 2011, Springer-Verlag, Berlin Heidelberg.
Megiddo, N., Mixtures of order matrices and generalized order matrices. Discrete Math. 19:2 (1977), 177–181.
Pirlot, M., Vincke, P., Semiorders: Properties, Representations, Applications, Vol. 36. 2013, Springer Science & Business Media.
Préa, P., Fortin, D., An optimal algorithm to recognize robinsonian dissimilarities. J. Classification 31:3 (2014), 351–385.
Puppe, Clemens, 2016. The single-peaked domain revisited: A simple global characterization. In: COMSOC 2016.
Regenwetter, M., Dana, J., Davis-Stober, C., Testing transitivity of preferences on two-alternative forced choice data. Front. Psychol. 1:148 (2010), 1–15.
Regenwetter, M., Dana, J., Davis-Stober, C., Transitivity of preferences. Psychol. Rev., 118(1), 2011, 42.
Robinson, William S., A method for chronologically ordering archaeological deposits. Amer. Antiq. 16:4 (1951), 293–301.
Spanjaard, O., Weng, P., 2016. Single-peakedness based on the net preference matrix: Characterization and algorithms. In: 6th International Workshop on Computational Social Choice, COMSOC-2016.
Suck, R., Geometric and combinatorial properties of the polytope of binary choice probabilities. Math. Social Sci. 23:1 (1992), 81–102.
Sui, X., Francois-Nienaber, A., Boutilier, C., Multi-dimensional single-peaked consistency and its approximations. IJCAI, Vol. 13, 2013, Citeseer, 375–382.
Trick, M., Recognizing single-peaked preferences on a tree. Math. Social Sci. 17:3 (1989), 329–334.