Anonymity and strategy-proofness on a domain of single-peaked and single-dipped preferences
Oihane Gallo

TL;DR
This paper characterizes all strategy-proof and anonymous rules for locating a public facility on a line with agents having single-peaked or single-dipped preferences, extending existing results with a two-step median and majority approach.
Contribution
It provides a complete characterization of strategy-proof and anonymous location rules in a mixed preference domain, combining median-based and majority methods.
Findings
Characterization of all strategy-proof, anonymous rules in the domain.
Extension of median and majority methods to mixed preferences.
Equivalence between two different rule characterizations.
Abstract
We analyze the problem of locating a public facility on a line in a society where agents have either single-peaked or single-dipped preferences. We consider the domain analyzed in Alcalde-Unzu et al. (2024), where the type of preference of each agent is public information, but the location of her peak/dip as well as the rest of the preference are unknown. We characterize all strategy-proof and type-anonymous rules on this domain. Building on existing results, we provide a two-step characterization": first, the median between the peaks and a collection of fixed values is computed (Moulin, 1980), resulting in either a single alternative or a pair of contiguous alternatives. If the outcome of the median is a pair, we apply a double-quota majority method" in the second step to choose between the two alternatives in the pair (Moulin, 1983). We also show the additional conditions that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Logic, Reasoning, and Knowledge
