### Abstract

Highlights

► We apply relational algebra and RelView to the tournament choice problem. ► We deliver the relation-algebraic specifications of several choice sets. ► RelView evaluates the relation-algebraic expressions and visualizes the results. ► The method can be very useful to many problems of social choice and game theory.

Original language | English |
---|---|

Pages (from-to) | 636-645 |

Journal | European Journal of Operational Research |

Volume | 226 |

Issue number | 3 |

DOIs | |

Publication status | Published - 2013 |

Externally published | Yes |

### Fingerprint

### Cite this

*European Journal of Operational Research*,

*226*(3), 636-645. https://doi.org/10.1016/j.ejor.2012.11.025

}

*European Journal of Operational Research*, vol. 226, no. 3, pp. 636-645. https://doi.org/10.1016/j.ejor.2012.11.025

**Computing tournament solutions using relation algebra and RelView.** / Berghammer, Rudolf; Rusinowska, Agnieszka; de Swart, Harrie.

Research output: Contribution to journal › Article › Scientific › peer-review

TY - JOUR

T1 - Computing tournament solutions using relation algebra and RelView

AU - Berghammer, Rudolf

AU - Rusinowska, Agnieszka

AU - de Swart, Harrie

PY - 2013

Y1 - 2013

N2 - 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.Highlights► We apply relational algebra and RelView to the tournament choice problem. ► We deliver the relation-algebraic specifications of several choice sets. ► RelView evaluates the relation-algebraic expressions and visualizes the results. ► The method can be very useful to many problems of social choice and game theory.

AB - 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.Highlights► We apply relational algebra and RelView to the tournament choice problem. ► We deliver the relation-algebraic specifications of several choice sets. ► RelView evaluates the relation-algebraic expressions and visualizes the results. ► The method can be very useful to many problems of social choice and game theory.

U2 - 10.1016/j.ejor.2012.11.025

DO - 10.1016/j.ejor.2012.11.025

M3 - Article

VL - 226

SP - 636

EP - 645

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -