Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2022.07.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4287448641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with Kemeny ranking: What works when? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for identifying the Kemeny median ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of weak orderings of a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median linear orders: Heuristics and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for Kemeny rankings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Computational Social Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rank correlation coefficient with application to the consensus ranking problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5320763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence of clones as a criterion for voting rules / rank
 
Normal rank

Latest revision as of 03:17, 31 July 2024

scientific article
Language Label Description Also known as
English
Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
scientific article

    Statements

    Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2022
    0 references
    0 references
    group decisions and negotiations
    0 references
    combinatorial optimization
    0 references
    computational social choice
    0 references
    ranking aggregation
    0 references
    Kemeny method
    0 references
    0 references