Recoverability of choice functions and binary relations: some duality results

Kotaro Suzumura and Yongsheng Xu

Social Choice and Welfare, 2003, vol. 21, issue 1, 37 pages

Abstract: 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

Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00355-003-0199-9 (text/html)
Access to full text is restricted to subscribers.

Related works:
Working Paper: Recoverability of Choice Functions and Binary Relations: Some Duality Results (2002)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sochwe:v:21:y:2003:i:1:p:21-37

Ordering information: This journal article can be ordered from
http://www.springer. ... c+theory/journal/355

DOI: 10.1007/s00355-003-0199-9

Access Statistics for this article

Social Choice and Welfare is currently edited by Bhaskar Dutta, Marc Fleurbaey, Elizabeth Maggie Penn and Clemens Puppe

More articles in Social Choice and Welfare from Springer, The Society for Social Choice and Welfare Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().