It is difficult to tell if there is a Condorcet spanning tree (Q328521): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q42363055 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00186-016-0535-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2256978550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Popular Matchings in the Marriage and Roommates Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: POPULAR SPANNING TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to tell which is a Condorcet committee? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condorcet winning sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Simple Voting Systems for Electing Committees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Condorcet criterion and committee selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular Matchings in the Stable Marriage Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of alternatives as Condorcet winners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condorcet choice and the Ostrogorski paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Popular ranking / rank
 
Normal rank

Latest revision as of 19:13, 12 July 2024

scientific article
Language Label Description Also known as
English
It is difficult to tell if there is a Condorcet spanning tree
scientific article

    Statements

    It is difficult to tell if there is a Condorcet spanning tree (English)
    0 references
    0 references
    20 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree
    0 references
    Condorcet
    0 references
    computational complexity
    0 references
    social choice theory
    0 references
    0 references
    0 references