Abstract
In this paper, I shall develop an axiomatic theory for binary choice functions C defined for subsets of a grand domain U of alternatives. When V,X ⫃ U, I intend to interpret C(V,X) as the set of those alternatives of (V∩X) which, compared with alternatives of V, are regarded as not being worse than any alternative of (V∩X). In other words: x ∈ C(V,X) iff x ∈ (V∩X) & (y)(yPvx →y∈ (V-X)) where Pv is a preference relation included in VxV. (Read yPvx as: y is better than x in V.)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fishburn, P.C., [the editors were unsuccessful in identifying this item], 1975.
Jonsson, B. & A. Tarski, “Boolean Algebras with Operators,” American Journal of Mathematics 73, 1951.
Plott, C.R., “Path Independence, Rationality and Social Choice,” Econometrica 41, 1973.
Sen, A.K., [the editors were unsuccessful in identifying this item], 1969.
Sen, A.K., “Choice Functions and Revealed Preference,” The Review of Economic Studies 38, 1971.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Holmström-Hintikka, G., LindstrÖm, S., Sliwinski, R. (2001). Choice Based on Preference. In: Holmström-Hintikka, G., Lindström, S., Sliwinski, R. (eds) Collected Papers of Stig Kanger with Essays on his Life and Work. Synthese Library, vol 303. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0500-5_22
Download citation
DOI: https://doi.org/10.1007/978-94-010-0500-5_22
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-0022-5
Online ISBN: 978-94-010-0500-5
eBook Packages: Springer Book Archive