Computing tournament solutions using relation algebra and RelView
Rudolf Berghammer,
Agnieszka Rusinowska and
Harrie de Swart
European Journal of Operational Research, 2013, vol. 226, issue 3, 636-645
Abstract:
We describe a simple computing technique for the tournament choice problem. It rests upon relational modeling and uses the BDD-based computer system RelView for the evaluation of the relation-algebraic expressions that specify the solutions and for the visualization of the computed results. The Copeland set can immediately be identified using RelView’s labeling feature. Relation-algebraic specifications of the Condorcet non-losers, the Schwartz set, the top cycle, the uncovered set, the minimal covering set, the Banks set, and the tournament equilibrium set are delivered. We present an example of a tournament on a small set of alternatives, for which the above choice sets are computed and visualized via RelView. The technique described in this paper is very flexible and especially appropriate for prototyping and experimentation, and as such very instructive for educational purposes. It can easily be applied to other problems of social choice and game theory.
Keywords: Tournament; Relational algebra; RelView; Copeland set; Condorcet non-losers; Schwartz set (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221712008739
Full text for ScienceDirect subscribers only
Related works:
Working Paper: Computing tournament solutions using relation algebra and RelView (2013) 
Working Paper: Computing tournament solutions using relation algebra and RelView (2013) 
Working Paper: Computing tournament solutions using relation algebra and RelView (2013) 
Working Paper: Computing Tournament Solutions using Relation Algebra and REL VIEW (2011) 
Working Paper: Computing Tournament Solutions using Relation Algebra and REL VIEW (2011) 
Working Paper: Computing Tournament Solutions using Relation Algebra and REL VIEW (2011) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:226:y:2013:i:3:p:636-645
DOI: 10.1016/j.ejor.2012.11.025
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().