Skip to Main content Skip to Navigation
Other publications

Computing Tournament Solutions using Relation Algebra and REL VIEW

Abstract : We 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.
Document type :
Other publications
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://halshs.archives-ouvertes.fr/halshs-00639942
Contributor : Lucie Label <>
Submitted on : Thursday, November 10, 2011 - 11:22:31 AM
Last modification on : Tuesday, January 19, 2021 - 11:08:28 AM
Long-term archiving on: : Saturday, February 11, 2012 - 2:23:12 AM

File

11067.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : halshs-00639942, version 1

Collections

Citation

Rudolf Berghammer, Agnieszka Rusinowska, Harrie de Swart. Computing Tournament Solutions using Relation Algebra and REL VIEW. 2011. ⟨halshs-00639942⟩

Share

Metrics

Record views

242

Files downloads

407