Pages that link to "Item:Q4166483"
From MaRDI portal
The following pages link to A Consistent Extension of Condorcet’s Election Principle (Q4166483):
Displayed 11 items.
- (Q4883193) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation (Q5868914) (← links)
- Strategyproof and efficient preference aggregation with Kemeny-based criteria (Q5964695) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
- Distance on matchings: An axiomatic approach (Q6076902) (← links)
- Partition–Mallows Model and Its Inference for Rank Aggregation (Q6107212) (← links)
- Collective schedules: axioms and algorithms (Q6109540) (← links)
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms (Q6139170) (← links)
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems (Q6164371) (← links)
- Mean-based Borda count for paradox-free comparisons of optimization algorithms (Q6198764) (← links)