Networks with Condorcet solutions

DOI10.1016/0377-2217(85)90004-9zbMath0564.90011OpenAlexW1994586124MaRDI QIDQ1058436

Hans-Jürgen Bandelt

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90004-9

zbMATH Keywords

polynomial algorithmlocation on networksCondorcet point on a networkWeber points

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (26)

Competitive location and pricing on networks with random utilities ⋮ How bad can a voting locating be ⋮ Competitive location on a network ⋮ Hard cases of the multifacility location problem ⋮ Tiled partial cubes ⋮ On condorcet and median points of simple rectilinear polygons ⋮ One more well-solved case of the multifacility location problem ⋮ \((r|p)\)-centroid problems on networks with vertex and edge demand ⋮ Distance weighted voting and a single facility location problem ⋮ A Helly theorem in weakly modular space ⋮ Metric packing for \(K_ 3 + K_ 3\) ⋮ Ramified rectilinear polygons: coordinatization by dendrons ⋮ Sequential competitive location on networks ⋮ Condorcet winners on median spaces ⋮ Graphs of some CAT(0) complexes ⋮ Lattice valuations, medians and majorities ⋮ Condorcet winner configurations of linear networks ⋮ Comparison of \(\alpha\)-Condorcet points with median and center locations ⋮ Outcomes of bargaining and planning in single facility location problems ⋮ Unnamed Item ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Minimum 0-extension problems on directed metrics ⋮ Metrics with finite sets of primitive extensions ⋮ A characterization of minimizable metrics in the multifacility location problem ⋮ Conditional Location Problems on Networks and in the Plane ⋮ Outcomes of voting and planning in single facility location problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Medians in median graphs
• Hereditary modular graphs
• New perspectives in competitive location theory
• Endomorphism semigroups of median algebras
• On locating new facilities in a competitive environment
• The structure of median graphs
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Some Generalizations of Social Decisions under Majority Rule
• Equivalence of Solutions to Network Location Problems

This page was built for publication: Networks with Condorcet solutions