Characterization of Generalized Weak Orders and Revealed Preference
This short paper provides an alternative framework to axiomatize various binary preference relations such as semiorder, weak semiorder etc. A set of simple axioms is presented in terms of revealed-preferred and revealed-inferior alternatives which makes the connection between various binary preference relations transparent; and every single axiom is necessary and sufficient for the existence of a binary preference relation of a specified type.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 3 (1993)
Issue (Month): 3 (July)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm |
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:3:y:1993:i:3:p:571-76. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.