Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
DOI10.1016/j.jlap.2013.02.001zbMath1278.91049OpenAlexW2031951122WikidataQ114851540 ScholiaQ114851540MaRDI QIDQ383785
Publication date: 6 December 2013
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2013.02.001
social choice theoryrelation algebrabinary decision diagramdominance relationBanks setrelation-algebraic specificationRelView tool
Symbolic computation and algebraic computation (68W30) Directed graphs (digraphs), tournaments (05C20) Social choice (91B14)
Related Items (4)
Uses Software
Cites Work
- Power indices of simple games and vector-weighted majority games by means of binary decision diagrams
- Relation-algebraic specification and solution of special university timetabling problems
- A relation-algebraic approach to simple games
- Relation-algebraic computation of fixed points with applications
- Applying relational algebra and REL VIEW to coalition formation
- Applying relation algebra and RelView to solve problems on orders and lattices
- Applying relation algebra and RelView to measures in a social network
- Sophisticated voting outcomes and agenda control
- A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
- Two graph algorithms derived
- Relation-algebraic modeling and solution of chessboard independence and domination problems
- Banks winners in tournaments are difficult to recognize
- Graph-Based Algorithms for Boolean Function Manipulation
- Computer Algebra in Scientific Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing and visualizing Banks sets of dominance relations using relation algebra and RelView