Condorcet choice correspondences for weak tournaments
暂无分享,去创建一个
Tournaments are complete and asymmetric binary relations. This type of binary relation rules out the possibility of ties or indifferences which are common in different contexts. In this work we generalize, from a normative point of view, some important tournaments solutions (top cycle, uncovered set and minimal covering) to the context where ties are possible.