Computing tournament solutions using relation algebra and RelView

DOI10.1016/J.EJOR.2012.11.025MaRDI QIDQ2253612zbMATH OpenOpenAlexFDO

Authors Rudolf Berghammer, Agnieszka Rusinowska, Harrie de Swart

Publication date 27 July 2014

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2012.11.025

zbMATH Keywords

tournamentrelational algebraRelViewSchwartz setCopeland setCondorcet non-losers

Mathematics Subject Classification ID

Cooperative games (91A12) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) Voting theory (91B12)

Recommendations

• Computing and visualizing Banks sets of dominance relations using relation algebra and RelView
• Computational social choice using relation algebra and RelView
• Computing minimal extending sets by relation-algebraic modeling and development
• A consistent tournament solution
• Computations on simple games using \texttt{RelView}

Cited in

(12)

• Computing minimal extending sets by relation-algebraic modeling and development
• Spatial voting games, relation algebra and RelView
• On computing representatives
• Relation-algebraic verification of Prim's minimum spanning tree algorithm
• Verifying minimum spanning tree algorithms with Stone relation algebras
• Computational social choice using relation algebra and RelView
• Computations on simple games using \texttt{RelView}
• Control of Condorcet voting: complexity and a relation-algebraic approach
• Relation-algebraic verification of Borůvka's minimum spanning tree algorithm
• An algebraic framework for minimum spanning tree problems
• Relational Modelling and Solution of Chessboard Problems
• Stone relation algebras

Describes a project that uses

Uses Software

• RelView

This page was built for publication: Computing tournament solutions using relation algebra and RelView

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253612)