Computing minimal extending sets by relation-algebraic modeling and development
From MaRDI portal
Publication:406434
DOI10.1016/J.JLAP.2014.02.002zbMATH Open1434.91032OpenAlexW1990204547MaRDI QIDQ406434FDOQ406434
Publication date: 8 September 2014
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2014.02.002
Social choice (91B14) Symbolic computation and algebraic computation (68W30) Cylindric and polyadic algebras; relation algebras (03G15)
Cites Work
- Computer Algebra in Scientific Computing
- Sophisticated voting outcomes and agenda control
- Title not available (Why is that?)
- Tournament solutions and majority voting
- Feedback Vertex Sets in Tournaments
- Applying relation algebra and RelView to measures in a social network
- Computing tournament solutions using relation algebra and RelView
- Title not available (Why is that?)
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
- Uncovered sets
- Banks winners in tournaments are difficult to recognize
- Applying relational algebra and REL VIEW to coalition formation
- Choosing from a large tournament
- A survey on the complexity of tournament solutions
- A counterexample to a conjecture of Schwartz
- Symmetric quotients and domain constructions
- Minimal stable sets in tournaments
- Cyclic tournaments and cooperative majority voting: A solution
Cited In (3)
Uses Software
Recommendations
- Computing tournament solutions using relation algebra and RelView π π
- Minimal extending sets in tournaments π π
- Computing the minimal covering set π π
- Computing and visualizing Banks sets of dominance relations using relation algebra and RelView π π
- Minimal stable sets in tournaments π π
This page was built for publication: Computing minimal extending sets by relation-algebraic modeling and development
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406434)