It is difficult to tell if there is a Condorcet spanning tree
From MaRDI portal
Publication:328521
DOI10.1007/s00186-016-0535-3zbMath1414.91129WikidataQ42363055 ScholiaQ42363055MaRDI QIDQ328521
Publication date: 20 October 2016
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-016-0535-3
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
91B14: Social choice
Related Items
Popular Branchings and Their Dual Certificates, A social choice approach to ordinal group activity selection, Popular branchings and their dual certificates, Minimal envy and popular matchings
Cites Work
- Unnamed Item
- Unnamed Item
- How hard is it to tell which is a Condorcet committee?
- Graph aggregation
- A simplified NP-complete satisfiability problem
- The Condorcet criterion and committee selection
- Voting schemes for which it can be difficult to tell who won the election
- Condorcet choice and the Ostrogorski paradox
- Condorcet winning sets
- Popular ranking
- Sets of alternatives as Condorcet winners
- Popular Matchings in the Stable Marriage Problem
- Popular Matchings in the Marriage and Roommates Problems
- An Analysis of Simple Voting Systems for Electing Committees
- POPULAR SPANNING TREES
