Recoverability of choice functions and binary relations: some duality results
Banerjee and Pattanaik (1996) proved a theorem that the maximal set with respect to a quasi-ordering can be fully recovered by defining the greatest sets with respect to each and every ordering extension thereof and taking their union. Donaldson and Weymark (1998) proved a theorem that a quasi-ordering can be fully recovered by taking the intersection of all the ordering extensions thereof. These recoverability theorems are obviously related, but their exact relationship has never been clarified in the literature. This paper examines the issue of choice-functional recoverability and relational recoverability in a general framework, and establishes several remarkable duality relationships. Copyright Springer-Verlag 2003
Volume (Year): 21 (2003)
Issue (Month): 1 (08)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/economic+theory/journal/355|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:21:y:2003:i:1:p:21-37. 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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.