Characterizations of the 3-cycle count and backward length of a tournament
From MaRDI portal
Publication:1767699
DOI10.1016/j.ejor.2003.09.032zbMath1057.91019OpenAlexW2171036521MaRDI QIDQ1767699
Publication date: 8 March 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.09.032
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Preference modelling
- Ordering pairwise comparison structures
- Ranking methods based on valued preference relations. A characterization of the net flow method
- Measuring intransitivity
- An intrinsic consistency threshold for reciprocal matrices
- Tournament solutions and majority voting
- Characterizations of scoring methods for preference aggregation
- Condorcet choice correspondences for weak tournaments
- On the axiomatic method and its recent applications to game theory and resource allocation
- Stable sets and standards of behaviour
- Centers in Connected Undirected Graphs: An Axiomatic Approach
- Ranking the Vertices of a Paired Comparison Digraph
- On the Minimum Violations Ranking of a Tournament
- Ordinal ranking methods for multicriterion decision making
- ON THE METHOD OF PAIRED COMPARISONS
This page was built for publication: Characterizations of the 3-cycle count and backward length of a tournament