We describe a simple computing technique for the tournament choice problem. It rests upon relational modeling and uses …, 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 …

We describe a simple computing technique for the tournament choice problem. It rests upon a relational modeling and … 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 …

We describe a simple computing technique for the tournament choice problem. It rests upon relational modeling and uses …, 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 …

We describe a simple computing technique for the tournament choice problem. It rests upon relational modeling and uses …, 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 …

We describe a simple computing technique for the tournament choice problem. It rests upon relational modeling and uses …, 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 …