The following pages link to Networks with Condorcet solutions (Q1058436):
Displaying 26 items.
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- Condorcet winners on median spaces (Q483121) (← links)
- Lattice valuations, medians and majorities (Q686486) (← links)
- Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
- Outcomes of voting and planning in single facility location problems (Q1060128) (← links)
- How bad can a voting locating be (Q1082239) (← links)
- Distance weighted voting and a single facility location problem (Q1120459) (← links)
- A Helly theorem in weakly modular space (Q1126279) (← links)
- Metrics with finite sets of primitive extensions (Q1293426) (← links)
- A characterization of minimizable metrics in the multifacility location problem (Q1582478) (← links)
- Hard cases of the multifacility location problem (Q1887076) (← links)
- Metric packing for \(K_ 3 + K_ 3\) (Q1945273) (← links)
- Graphs of some CAT(0) complexes (Q1973869) (← links)
- Minimum 0-extension problems on directed metrics (Q2042078) (← links)
- Outcomes of bargaining and planning in single facility location problems (Q2270333) (← links)
- Competitive location and pricing on networks with random utilities (Q2357929) (← links)
- Competitive location on a network (Q2367390) (← links)
- One more well-solved case of the multifacility location problem (Q2386213) (← links)
- Condorcet winner configurations of linear networks (Q3577841) (← links)
- Tiled partial cubes (Q4539873) (← links)
- On condorcet and median points of simple rectilinear polygons (Q5055889) (← links)
- (Q5089214) (← links)
- Conditional Location Problems on Networks and in the Plane (Q5506724) (← links)
- Comparison of \(\alpha\)-Condorcet points with median and center locations (Q5937140) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
