Relaxation of the Condorcet and Simpson conditions in voting location

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

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

Publication date: 10 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00161-3

zbMATH Keywords

locationdecision analysisgroup decisions and negotiation

Mathematics Subject Classification ID

Decision theory (91B06) Voting theory (91B12) Discrete location and assignment (90B80)

Related Items (9)

Improved algorithms for some competitive location centroid problems on paths, trees and graphs ⋮ Multiple voting location and single voting location on trees ⋮ Sequential competitive location on networks ⋮ Multiple voting location problems ⋮ Relaxed voting and competitive location under monotonous gain functions on trees ⋮ Outcomes of bargaining and planning in single facility location problems ⋮ 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 ⋮ Conditional Location Problems on Networks and in the Plane

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

This page was built for publication: Relaxation of the Condorcet and Simpson conditions in voting location