Pages that link to "Item:Q4166483"

The following pages link to A Consistent Extension of Condorcet’s Election Principle (Q4166483):

Displaying 50 items.

• Link prediction in multiplex networks (Q258449) (← links)
• A new characterization of simple majority (Q374842) (← links)
• Variable-population voting rules (Q386060) (← links)
• The Condorcet set: majority voting over interconnected propositions (Q402080) (← links)
• Experiments with Kemeny ranking: What works when? (Q449040) (← links)
• Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
• Independence of irrelevant alternatives revisited (Q483921) (← links)
• Extensions of the Young and Levenglick result about the inconsistency of Condorcet voting correspondences (Q554496) (← links)
• Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
• Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
• Statistical ranking and combinatorial Hodge theory (Q633110) (← links)
• Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
• Rank-based choice correspondences (Q673207) (← links)
• A prudent characterization of the ranked pairs rule (Q733778) (← links)
• Methods for distance-based judgment aggregation (Q733803) (← links)
• The complexity of Kemeny elections (Q817813) (← links)
• An extension of the Moulin no show paradox for voting correspondences (Q836920) (← links)
• Characteristic properties of list proportional representation systems (Q857969) (← links)
• A distance-based comparison of basic voting rules (Q882604) (← links)
• Distance rationalization of voting rules (Q892848) (← links)
• Spatial implementation (Q894629) (← links)
• Photo sequencing (Q901810) (← links)
• A conflict analysis approach for illuminating distributional issues in sustainability policy (Q953459) (← links)
• A characterization of the prudent order preference function (Q1042325) (← links)
• Dimensions of election procedures: Analyses and comparisons (Q1055323) (← links)
• Research in decision theory: A personal perspective (Q1056649) (← links)
• Tournament methods in choice theory (Q1085019) (← links)
• On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
• Voting schemes for which it can be difficult to tell who won the election (Q1120433) (← links)
• Three practical criteria of comparison among ordinal preference aggregating rules (Q1127146) (← links)
• A branch and bound algorithm for the acyclic subgraph problem (Q1154950) (← links)
• The median procedure in cluster analysis and social choice theory (Q1164937) (← links)
• Arrow's theorem: Unusual domains and extended codomains (Q1167044) (← links)
• Characterizations of the plurality function (Q1177101) (← links)
• Consensus sequences based on plurality rule (Q1199388) (← links)
• Preferences, agreement, consensus -- measuring, aggregation and control -- (Q1339202) (← links)
• On the consistency of the plurality rule consensus function for molecular sequences (Q1344860) (← links)
• Discrete analysis of expert information. Research trends (Q1366884) (← links)
• The median procedure on median graphs (Q1392574) (← links)
• Choosing from a weighted tournament (Q1575093) (← links)
• Cosine similarity and the Borda rule (Q1649084) (← links)
• Non-compensatory composite indicators for the evaluation of urban planning policy: the Land-Use Policy Efficiency Index (LUPEI) (Q1681498) (← links)
• Axiomatic characterization of committee scoring rules (Q1729676) (← links)
• The impact of indifferent voters on the likelihood of some voting paradoxes (Q1763193) (← links)
• The median procedure for n-trees (Q1822174) (← links)
• The median procedure in the semilattice of orders (Q1874539) (← links)
• An approach to formalization and analysis of group choice problems (Q1905158) (← links)
• The asymptotic plurality rule for molecular sequences (Q1910780) (← links)
• On the probability that all decision rules select the same winner (Q1972344) (← links)
• Node classification over bipartite graphs through projection (Q2051228) (← links)