Weak covering relations

DOI10.1007/BF01079911zbMath0815.90005OpenAlexW1966415899MaRDI QIDQ1342391

Gilbert Laffond, Lainé, Jean

Publication date: 27 June 1995

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01079911

zbMATH Keywords

directed graphcovering relationuncovered set\(k\)-covering relationsfinite tournament

Mathematics Subject Classification ID

Voting theory (91B12) Individual preferences (91B08) Directed graphs (digraphs), tournaments (05C20) Social choice (91B14)

Related Items

Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule, Representation in majority tournaments, Condorcet choice and the Ostrogorski paradox

Cites Work

• Unnamed Item
• On the tournament equilibrium set
• Slater's winners of a tournament may not be in the Banks set
• Covering relations, closest orderings and Hamiltonian bypaths in tournaments
• Cyclic tournaments and cooperative majority voting: A solution
• Sophisticated voting outcomes and agenda control
• The Copeland choice function. An axiomatic characterization
• Choosing from a tournament
• The uncovered set in spatial voting games
• Covering sets and a new Condorcet choice correspondence
• The Voting Problem
• Ranking the Participants in a Tournament