Maximal elements of non necessarily acyclic binary relations
The existence of maximal elements for binary preference relations is analyzed without imposing transitivity or convexity conditions. From each preference relation a new acyclic relation is defined in such a way that some maximal elements of this new relation characterize maximal elements of the original one. The result covers the case whereby the relation is acyclic.
|Date of creation:||Dec 1992|
|Date of revision:|
|Publication status:||Published by Ivie|
|Contact details of provider:|| Postal: C/ Guardia Civil, 22, Esc 2a, 1o, E-46020 VALENCIA|
Phone: +34 96 319 00 50
Fax: +34 96 319 00 55
Web page: http://www.ivie.es/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ivi:wpasad:1992-07. 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: (Departamento de Edición)
If references are entirely missing, you can add them using this form.