Relaxation of the Condorcet and Simpson conditions in voting location

DOI10.1016/S0377-2217(02)00161-3zbMath1012.91010MaRDI QIDQ1869503

Clara M. Campos Rodríguez, José A. Moreno Pérez

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

location; decision analysis; group decisions and negotiation

Mathematics Subject Classification ID

91B06: Decision theory

91B12: Voting theory

90B80: Discrete location and assignment

Related Items

Conditional Location Problems on Networks and in the Plane, Sequential competitive location on networks, Multiple voting location and single voting location on trees, Multiple voting location problems, Relaxed voting and competitive location under monotonous gain functions on trees, Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree, \((r,p)\)-centroid problems on paths and trees, Outcomes of bargaining and planning in single facility location problems, Improved algorithms for some competitive location centroid problems on paths, trees and graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Outcomes of voting and planning in single facility location problems
• Distance weighted voting and a single facility location problem
• Semiorders. Properties, representations, applications
• Algorithms for Voting and Competitive Location on a Network
• Conditions for Voting Equilibria in Continuous Voter Distributions
• Voting Equilibria in Multidimensional Choice Spaces
• Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case
• Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case