Theory and Decision 44 (3):279-292 (1998)

Abstract
An efficient method of value assessment of a set of exchangeable alternatives A = a1,a2, ? ,an is presented. It particularly applies to situations where certain preferences may be easily evaluated or are already known, while other binary comparisons may not at once be available. Further applications are to ranking partial tournaments and the emergence and the characterisation of organisational hierarchy. By sequentially performing transitively efficient assessments of uncompared pairs, an initial weakly acyclical preference structure in A is transformed into an ordering of A in echelons. We call these nicely surveyable preference structures echelon orders. Theoretical properties of echelon orders are investigated, including a characterisation and a numerical representation
Keywords Preference structure  Ordering  Echelons  Hierarchy  Exchangeability
Categories (categorize this paper)
DOI 10.1023/A:1004990529105
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 52,768
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2010-09-02

Total views
44 ( #216,691 of 2,340,326 )

Recent downloads (6 months)
1 ( #514,582 of 2,340,326 )

How can I increase my downloads?

Downloads

My notes