Computing tournament solutions using relation algebra and RelView - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2013

Computing tournament solutions using relation algebra and RelView

Rudolf Berghammer
  • Fonction : Auteur
  • PersonId : 878837
Harrie de Swart
  • Fonction : Auteur
  • PersonId : 899711

Résumé

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.
Fichier principal
Vignette du fichier
EJOR-Paper.pdf (254.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00756696 , version 1 (23-11-2012)

Identifiants

Citer

Rudolf Berghammer, Agnieszka Rusinowska, Harrie de Swart. Computing tournament solutions using relation algebra and RelView. European Journal of Operational Research, 2013, 226 (3), pp.636-645. ⟨10.1016/j.ejor.2012.11.025⟩. ⟨hal-00756696⟩
155 Consultations
245 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More