A Note on Semiorders and Choice Functions.

Abstract

With P a binary preference relation on a set of decision alternatives let C(X) be the P-maximal in X for each non-empty subset X of alternatives. Conditions on the choice function C are given for each of five types of P relations so that the conditions on C hold if and only if the P relation is of the specified type. The types of relations covered are acyclic orders, strict partial orders, semitransitive orders, interval orders and semiorders. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1974
Accession Number
AD0786195

Entities

People

  • Peter C. Fishburn

Organizations

  • Pennsylvania State University

Tags

Readers

  • Graph Algorithms and Convex Optimization.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.