Computing minimal extending sets by relation-algebraic modeling and development

DOI10.1016/j.jlap.2014.02.002zbMath1434.91032OpenAlexW1990204547MaRDI QIDQ406434

Rudolf Berghammer

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

zbMATH Keywords

social choice theoryrelation algebratournamentminimal extending setrelation-algebraic modeling

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Social choice (91B14) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (1)

Relations as Images

Uses Software

• RelView
• Prover9

Cites Work

• Unnamed Item
• Unnamed Item
• Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
• Symmetric quotients and domain constructions
• Minimal stable sets in tournaments
• Applying relational algebra and REL VIEW to coalition formation
• Cyclic tournaments and cooperative majority voting: A solution
• Choosing from a large tournament
• Applying relation algebra and RelView to measures in a social network
• A survey on the complexity of tournament solutions
• Sophisticated voting outcomes and agenda control
• Tournament solutions and majority voting
• Computing tournament solutions using relation algebra and RelView
• A counterexample to a conjecture of Schwartz
• Uncovered sets
• Banks winners in tournaments are difficult to recognize
• Feedback Vertex Sets in Tournaments
• Computer Algebra in Scientific Computing

This page was built for publication: Computing minimal extending sets by relation-algebraic modeling and development