.png){kind=icon}
Return
Computing tournament solutions using relation algebra and RELVIEW
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2012.11.025.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Tournament
Relational algebra
RELVIEW
Copeland set
Condorcet non-losers
Schwartz set
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations
Cited Papers
ShareSave
ShareSaveSpray and Combustion Characteristics of HCCI Engine Using DME/Diesel Blended Fuel by Port-Injection
PREAI
ShareSaveShareSaveShareSaveAcid–base and coordination properties of 2-phenyl-3-hydroxy-4-quinolones in aqueous media.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave View more