Ordinally consistent tournament solutions
| dc.contributor.author | Sprumont, Yves | |
| dc.date.accessioned | 2016-03-22T18:06:50Z | |
| dc.date.available | 2016-03-22T18:06:50Z | |
| dc.date.issued | 2016-03 | |
| dc.identifier.uri | http://hdl.handle.net/1866/13353 | |
| dc.publisher | Université de Montréal. Département de sciences économiques. | fr |
| dc.subject | Tournaments | fr |
| dc.subject | Ranking methods | fr |
| dc.title | Ordinally consistent tournament solutions | fr |
| dc.type | Article | fr |
| dc.contributor.affiliation | Université de Montréal. Faculté des arts et des sciences. Département de sciences économiques | |
| dcterms.abstract | A set ranking method assigns to each tournament on a given set an ordering of the subsets of that set. Such a method is consistent if (i) the items in the set are ranked in the same order as the sets of items they beat and (ii) the ordering of the items fully determines the ordering of the sets of items. We describe two consistent set ranking methods. | fr |
| dcterms.isPartOf | urn:ISSN:0709-9231 | |
| dcterms.language | eng | fr |
| UdeM.VersionRioxx | Version publiée / Version of Record | |
| oaire.citationTitle | Cahier de recherche | |
| oaire.citationIssue | 2016-05 |
Files in this item
This item appears in the following Collection(s)
This document disseminated on Papyrus is the exclusive property of the copyright holders and is protected by the Copyright Act (R.S.C. 1985, c. C-42). It may be used for fair dealing and non-commercial purposes, for private study or research, criticism and review as provided by law. For any other use, written authorization from the copyright holders is required.