Choice of best alternatives on directed graphs and tournaments (Q1113777)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Choice of best alternatives on directed graphs and tournaments |
scientific article; zbMATH DE number 4081237
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Choice of best alternatives on directed graphs and tournaments |
scientific article; zbMATH DE number 4081237 |
Statements
Choice of best alternatives on directed graphs and tournaments (English)
0 references
1988
0 references
The article presents a literature survey of choice procedures using a binary preference relation defined on the set of alternatives (a directed graph). Choice procedures for the case when the binary relation is a tournament (i.e., asymmetric and complete) are considered separately.
0 references
literature survey
0 references
choice procedures
0 references
binary preference relation
0 references
directed graph
0 references
tournament
0 references
