Relaxation of the Condorcet and Simpson conditions in voting location

DOI10.1016/S0377-2217(02)00161-3zbMATH Open1012.91010OpenAlexW2099440765MaRDI QIDQ1869503FDOQ1869503

Authors: Clara M. Campos Rodríguez, José Pérez 

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

Recommendations

• Comparison of \(\alpha\)-Condorcet points with median and center locations
• How bad can a voting locating be
• The tolerant Condorcet points
• Distance weighted voting and a single facility location problem
• Multiple voting location and single voting location on trees

zbMATH Keywords

decision analysislocationgroup decisions and negotiation

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
• Semiorders. Properties, representations, applications
• Algorithms for Voting and Competitive Location on a Network
• Outcomes of voting and planning in single facility location problems
• The tolerant Condorcet points
• Conditions for Voting Equilibria in Continuous Voter Distributions
• Voting Equilibria in Multidimensional Choice Spaces
• Distance weighted voting and a single facility location problem
• Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case

Cited In (11)

• Outcomes of bargaining and planning in single facility location problems
• Multiple voting location and single voting location on trees
• Sequential competitive location on networks
• 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
• Conditional Location Problems on Networks and in the Plane
• The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
• Multiple voting location problems
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs
• \((r,p)\)-centroid problems on paths and trees
• How bad can a voting locating be

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869503)