Computing minimal extending sets by relation-algebraic modeling and development

DOI10.1016/J.JLAP.2014.02.002MaRDI QIDQ406434zbMATH OpenOpenAlexFDO

Authors 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 theorytournamentrelation algebraminimal extending setrelation-algebraic modeling

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 234018 (Why is no real title available?)
• A counterexample to a conjecture of Schwartz
• A survey on the complexity of tournament solutions
• Applying relation algebra and RelView to measures in a social network
• Applying relational algebra and REL VIEW to coalition formation
• Approval voting
• Banks winners in tournaments are difficult to recognize
• Choosing from a large tournament
• Computer Algebra in Scientific Computing
• Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
• Computing tournament solutions using relation algebra and RelView
• Cyclic tournaments and cooperative majority voting: A solution
• Feedback vertex sets in tournaments
• Minimal stable sets in tournaments
• Sophisticated voting outcomes and agenda control
• Symmetric quotients and domain constructions
• Tournament solutions and majority voting
• Uncovered sets

Cited in

(6)

• Relations as images
• Minimal extending sets in tournaments
• Column-wise extendible vector expressions and the relational computation of sets of sets
• Algebraic relation of three MinRank algebraic modelings
• An algorithm to minimize representations of finite order relations
• Computing tournament solutions using relation algebra and RelView

Describes a project that uses

Uses Software

• Prover9
• RelView

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)