Choice functions over a finite set: A summary (Q1064952): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: General theory of best variants choice: Some aspects / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00437315 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2016120321 / rank | |||
Normal rank |
Latest revision as of 08:33, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Choice functions over a finite set: A summary |
scientific article |
Statements
Choice functions over a finite set: A summary (English)
0 references
1985
0 references
Let A be a finite set of outcomes and B a nonempty subset of A. Let S be a choice function, such that S(B) is nonempty for all S. The following conditions on S are crucial: Chernoff: \(B\subset B'\to S(B')\cap B\subset S(B)\). Expansion: S(B)\(\cap S(B')\subset S(B\cup B')\). Aizerman: [S(B')\(\subset B\subset B']\to [S(B)\subset S(B')].\) The main results are the following. S is rationalizable if and only if it satisfies the Chernoff and Expansion conditions. S is Pareto- rationalizable if and only if it satisfies the Aizerman and Expansion conditions. Finally, S is pseudo-rationalizable if and only if it satisfies the Chernoff and Aizerman conditions. Although these results have existed in Russian for some time, this is the first time that they have been readily available in the West.
0 references
rationalizability
0 references
Chernoff condition
0 references
choice function
0 references
Expansion conditions
0 references
Aizerman conditions
0 references