Accession Number : AD0786196

Title :   Representable Choice Functions.

Descriptive Note : Technical rept.,

Corporate Author : PENNSYLVANIA STATE UNIV UNIVERSITY PARK COLL OF BUSINESS ADMINISTRATION

Personal Author(s) : Fishburn,Peter C.

Report Date : SEP 1974

Pagination or Media Count : 23

Abstract : A choice function, which maps each set of alternatives in a domain of feasible sets into a non-empty subset of itself (called the choice set), is said to be representable by a weak order if some weak order on the alternatives has maximum elements within each feasible set, all of which are in the choice set of that feasible set. A Partial Congruence Axiom ('every non-empty finite collection of feasible sets has an alternative which is in the choice set of every feasible set in the collection which contains that alternative') is shown to be necessary and sufficient for weak order representability when all choice sets are finite. (Modified author abstract)

Descriptors :   *Decision making, Mathematical models, Set theory, Theorems

Subject Categories : Administration and Management
      Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE