Computing Tournament Solutions using Relation Algebra and REL VIEW
AbstractWe describe a simple computing technique for the tournament choice problem. It rests upon a 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by HAL in its series Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) with number halshs-00639942.
Date of creation: Oct 2011
Date of revision:
Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00639942
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/
Tournament; relational algebra; RelView; Copeland set; Condorcet non-losers; Schwartz set; top cycle; uncovered set; minimal covering set; Banks set; tournament equilibrium set.;
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Michel Grabisch & Agnieszka Rusinowska, 2008.
"A model of influence in a social network,"
Documents de travail du Centre d'Economie de la Sorbonne
b08066, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Michel Grabisch & Agnieszka Rusinowska, 2010. "A model of influence in a social network," UniversitÃ© Paris1 PanthÃ©on-Sorbonne (Post-Print and Working Papers) halshs-00308741, HAL.
- Michel Grabisch & Agnieszka Rusinowska, 2008. "A model of influence in a social network," UniversitÃ© Paris1 PanthÃ©on-Sorbonne (Post-Print and Working Papers) halshs-00344457, HAL.
- John Duggan, 2011. "Uncovered Sets," Wallis Working Papers WP63, University of Rochester - Wallis Institute of Political Economy.
- Smith, John H, 1973. "Aggregation of Preferences with Variable Electorate," Econometrica, Econometric Society, vol. 41(6), pages 1027-41, November.
- Brandt, Felix & Fischer, Felix, 2008. "Computing the minimal covering set," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 254-268, September.
- Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (CCSD).
If references are entirely missing, you can add them using this form.