Strategy-proofness on Euclidean spaces
AbstractIn this paper we characterize strategy-proof voting schemes on Euclidean spaces. A voting scheme is strategy-proof whenever it is optimal for every agent to report his best alternative. Here the individual preferences underlying these best choices are separable and quadratic. It turns out that a voting scheme is strategy-proof if and only if () its range is a closed Cartesian subset of Euclidean space, () the outcomes are at a minimal distance to the outcome under a specific coordinatewise veto voting scheme, and () it satisfies some monotonicity properties. Neither continuity nor decomposability is implied by strategy-proofness, but these are satisfied if we additionally impose Pareto-optimality or unanimity.
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Social Choice and Welfare.
Volume (Year): 14 (1997)
Issue (Month): 3 ()
Note: Received: 18 October 1993/Accepted: 2 February 1996
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Schummer, James & Vohra, Rakesh V., 2002.
"Strategy-proof Location on a Network,"
Journal of Economic Theory,
Elsevier, vol. 104(2), pages 405-428, June.
- Bettina Klaus, 2001. "Target Rules for Public Choice Economies on Tree Networks and in Euclidean Spaces," Theory and Decision, Springer, vol. 51(1), pages 13-29, August.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
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.