Networks with Condorcet solutions
A Condorcet point on a network is a point such that there is no other point closer to a strict majority of users which are located at the vertices of the network. A complete characterization is given of those networks on which no Condorcet paradox occurs, in the sense that for each distribution of users there exists at least one Condorcet point. Moreover, those networks are characterized on which Condorcet points and Weber points always coincide. A polynomial algorithm is obtained which decides whether a given network has Condorcet points for all distributions of users on the network.
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Endomorphism semigroups of median algebras
- Equivalence of Solutions to Network Location Problems
- Hereditary modular graphs
- scientific article; zbMATH DE number 3835729 (Why is no real title available?)
- scientific article; zbMATH DE number 3697163 (Why is no real title available?)
- scientific article; zbMATH DE number 3512145 (Why is no real title available?)
- Medians in median graphs
- New perspectives in competitive location theory
- On locating new facilities in a competitive environment
- Some Generalizations of Social Decisions under Majority Rule
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- The structure of median graphs
- Outcomes of voting and planning in single facility location problems
- How bad can a voting locating be
- Distance weighted voting and a single facility location problem
- A Helly theorem in weakly modular space
- Metrics with finite sets of primitive extensions
- A characterization of minimizable metrics in the multifacility location problem
- Hard cases of the multifacility location problem
- Metric packing for \(K_ 3 + K_ 3\)
- Graphs of some CAT(0) complexes
- Minimum 0-extension problems on directed metrics
- Outcomes of bargaining and planning in single facility location problems
- Sorting out single-crossing preferences on networks
- Competitive location and pricing on networks with random utilities
- Competitive location on a network
- One more well-solved case of the multifacility location problem
- The tolerant Condorcet points
- It is difficult to tell if there is a Condorcet spanning tree
- \((r|p)\)-centroid problems on networks with vertex and edge demand
- Condorcet winner configurations of linear networks
- scientific article; zbMATH DE number 44761 (Why is no real title available?)
- scientific article; zbMATH DE number 44763 (Why is no real title available?)
- Sequential competitive location on networks
- Tiled partial cubes
- Condorcet winners on median spaces
- On condorcet and median points of simple rectilinear polygons
- scientific article; zbMATH DE number 7559417 (Why is no real title available?)
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
- The congenial talking philosophers problem in computer networks
- Conditional Location Problems on Networks and in the Plane
- Comparison of \(\alpha\)-Condorcet points with median and center locations
- Discrete convexity and polynomial solvability in minimum 0-extension problems
- ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and \(G^2\)-connected medians
- Generalized minimum 0-extension problem and discrete convexity
- Lattice valuations, medians and majorities
- Ramified rectilinear polygons: coordinatization by dendrons
This page was built for publication: Networks with Condorcet solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058436)
