Recognizing one-dimensional Euclidean preference profiles
A preference profile has a one-dimensional Euclidean representation if it can be derived from an arrangement of individuals and alternatives on a line, with each individual preferring the nearer of each pair of alternatives. We provide a polynomial-time algorithm that determines whether a given preference profile has a one-dimensional Euclidean representation and, if so, constructs one. This result has electoral and mechanism design applications.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jean-François Laslier, 2003. "Analysing a preference and approval profile," Social Choice and Welfare, Springer, vol. 20(2), pages 229-242, March.
- Miguel Ángel Ballester & Guillaume Haeringer, 2006.
"A Characterization of Single-Peaked Preferences,"
273, Barcelona Graduate School of Economics.
- Bogomolnaia, Anna & Laslier, Jean-Francois, 2007.
Journal of Mathematical Economics,
Elsevier, vol. 43(2), pages 87-98, February.
- Laslier, J.F., 1995. "Multivariate Analysis of Comparison Matrices," Papers 9504, Paris X - Nanterre, U.F.R. de Sc. Ec. Gest. Maths Infor..
- Eguia, Jon X., 2008. "The Foundations of Spatial Preferences," Working Papers 08-01, C.V. Starr Center for Applied Economics, New York University.
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:46:y:2010:i:1:p:1-5. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.