Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991)

From MaRDI portal
Revision as of 23:48, 21 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129717821, #quickstatements; #temporary_batch_1729550111923)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient algorithms using subiterative convergence for Kemeny ranking problem
scientific article

    Statements

    volume
    98
    0 references
    page(s)
    198-210
    0 references
    publication date
    October 2018
    0 references
    12 July 2018
    0 references
    author
    Prakash Singh Badal
    0 references
    Ashish Das
    0 references
    Y. Aharonov
    0 references
    title
    Efficient algorithms using subiterative convergence for Kemeny ranking problem (English)
    0 references
    zbMATH Keywords
    consensus ranking
    0 references
    heuristics
    0 references
    Kemeny distance
    0 references
    Kemeny-Snell distance
    0 references
    median ranking
    0 references
    rank aggregation problem
    0 references
    describes a project that uses
    AS 136
    0 references
    PrefLib
    0 references

    Identifiers

    Mathematics Subject Classification ID
    62F07
    0 references
    91B08
    0 references
    91B06
    0 references
    62P15
    0 references
    91B14
    0 references
    zbMATH DE Number
    6902869
    0 references
    OpenAlex ID
    W2807007444
    0 references
    Wikidata QID
    Q129717821
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q107991&oldid=37859608"
    Powered by MediaWiki