Pages that link to "Item:Q1164937"
From MaRDI portal
The following pages link to The median procedure in cluster analysis and social choice theory (Q1164937):
Displaying 50 items.
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach (Q62323) (← links)
- An ABC-problem for location and consensus functions on graphs (Q290094) (← links)
- Planar graded lattices and the \(c_1\)-median property (Q304195) (← links)
- A statistical view of clustering performance through the theory of \(U\)-processes (Q392047) (← links)
- The Condorcet set: majority voting over interconnected propositions (Q402080) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Voting with rubber bands, weights, and strings (Q449038) (← links)
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
- Thresholded consensus for n-trees (Q582778) (← links)
- Convex geometry and group choice (Q585057) (← links)
- The role of complexity in comparing classifications (Q585631) (← links)
- Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
- Lattice valuations, medians and majorities (Q686486) (← links)
- Facets of the clique partitioning polytope (Q752015) (← links)
- On the semilattice of weak orders of a set (Q760318) (← links)
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten (Q761244) (← links)
- Medians in median graphs (Q791544) (← links)
- Analyse qualitativer Daten: Einführung und Übersicht. I (Q792212) (← links)
- Faithful consensus methods for n-trees (Q794118) (← links)
- Optimal clustering of multipartite graphs (Q947074) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- A survey on the complexity of tournament solutions (Q1042317) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- On the information about individual utilities used in social choice (Q1056653) (← links)
- A formalization of consensus index methods (Q1062389) (← links)
- Axioms for consensus functions based on lower bounds in posets (Q1083346) (← links)
- Social compromise and social metrics (Q1083992) (← links)
- Metric rationalisation of social choice functions according to principles of social choice (Q1087454) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- Induced social welfare functions (Q1115785) (← links)
- Voting schemes for which it can be difficult to tell who won the election (Q1120433) (← links)
- A cutting plane algorithm for a clustering problem (Q1122492) (← links)
- Principal classifications analysis: a method for generating consensus dendrograms and its application to three-way data. (Q1129103) (← links)
- Metrics on partially ordered sets - a survey (Q1153517) (← links)
- Arrow's theorem is not a surprising result (Q1163458) (← links)
- A method for aggregating ordinal assessments by a majority decision rule (Q1168198) (← links)
- A converse to the Sholander embedding (Q1174172) (← links)
- Consensus sequences based on plurality rule (Q1199388) (← links)
- Interpreting consensus sequences based on plurality rule (Q1205295) (← links)
- Random generation of tournaments and asymmetric graphs with given out-degrees (Q1278398) (← links)
- The noising method: A new method for combinatorial optimization (Q1319680) (← links)
- Computing a median point of a simple rectilinear polygon (Q1321814) (← links)
- Medians for weight metrics in the covering graphs of semilattices (Q1327234) (← links)
- Preferences, agreement, consensus -- measuring, aggregation and control -- (Q1339202) (← links)
- On the consistency of the plurality rule consensus function for molecular sequences (Q1344860) (← links)
- Metric inference for social networks (Q1344868) (← links)
- New results on the computation of median orders (Q1356737) (← links)
- Concordance between two linear orders: The Spearman and Kendall coefficients revisited (Q1378870) (← links)
- Steiner intervals in graphs (Q1382264) (← links)
