Computing tournament solutions using relation algebra and RelView
From MaRDI portal
Publication:2253612
DOI10.1016/j.ejor.2012.11.025zbMath1292.91060MaRDI QIDQ2253612
Rudolf Berghammer, Agnieszka Rusinowska, H. C. M. 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
91A12: Cooperative games
91B12: Voting theory
91-04: Software, source code, etc. for problems pertaining to game theory, economics, and finance
Related Items
Stone Relation Algebras, Control of Condorcet voting: complexity and a relation-algebraic approach, Computing minimal extending sets by relation-algebraic modeling and development, Spatial voting games, relation algebra and RelView, An algebraic framework for minimum spanning tree problems, Verifying minimum spanning tree algorithms with Stone relation algebras, Relation-algebraic verification of Borůvka's minimum spanning tree algorithm, Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm
Uses Software