Weak covering relations (Q1342391): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Sophisticated voting outcomes and agenda control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering relations, closest orderings and Hamiltonian bypaths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering sets and a new Condorcet choice correspondence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tournament equilibrium set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uncovered set in spatial voting games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Copeland choice function. An axiomatic characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slater's winners of a tournament may not be in the Banks set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing from a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking the Participants in a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic tournaments and cooperative majority voting: A solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Voting Problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01079911 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966415899 / rank
 
Normal rank

Latest revision as of 11:14, 30 July 2024

scientific article
Language Label Description Also known as
English
Weak covering relations
scientific article

    Statements

    Weak covering relations (English)
    0 references
    0 references
    0 references
    0 references
    27 June 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    uncovered set
    0 references
    covering relation
    0 references
    finite tournament
    0 references
    \(k\)-covering relations
    0 references
    directed graph
    0 references
    0 references