2014/10/08 by Adam Clearwater, Clearwater, Adam, Clemens Puppe +3
Economics, Econometrics and Finance · #Computer Science and Game Theory (cs.GT) #Economic theories and models #FOS: Computer and information sciences #Fiscal Policy and Economic Growth #Game Theory and Voting Systems
paper · pdf · doi:10.48550/arxiv.1410.2272
openalex publication_date 2014/10/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those orders have transitive majority relation. We prove that for any tree there exist profiles that are single-crossing on that tree; moreover, that tree is minimal in this respect for at least one such profile. Finally, we provide a polynomial-time algorithm to recognize whether or not a given profile is single-crossing with respect to some tree. We also show that finding winners for Chamberlin-Courant rule is polynomial for profiles that are single-crossing on trees.