Advanced Search
MyIDEAS: Login

Recoverability of choice functions and binary relations: some duality results

Contents:

Author Info

  • Kotaro Suzumura

    ()

  • Yongsheng Xu

    ()

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

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://hdl.handle.net/10.1007/s00355-003-0199-9
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Springer in its journal Social Choice and Welfare.

Volume (Year): 21 (2003)
Issue (Month): 1 (08)
Pages: 21-37

as in new window
Handle: RePEc:spr:sochwe:v:21:y:2003:i:1:p:21-37

Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00355/index.htm

Order Information:
Web: http://link.springer.de/orders.htm

Related research

Keywords:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Bossert, Walter & Sprumont, Yves & Suzumura, Kotaro, 2002. "Upper semicontinuous extensions of binary relations," Journal of Mathematical Economics, Elsevier, vol. 37(3), pages 231-246, May.
  2. Clemens Puppe & Yongsheng Xu, 2010. "Essential alternatives and freedom rankings," Social Choice and Welfare, Springer, vol. 35(4), pages 669-685, October.
  3. repec:mtl:montec:2002-01 is not listed on IDEAS
  4. Athanasios Andrikopoulos, 2011. "Characterization of the existence of semicontinuous weak utilities for binary relations," Theory and Decision, Springer, vol. 70(1), pages 13-26, January.
  5. T. Demuynck, 2009. "Common ordering extensions," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 09/593, Ghent University, Faculty of Economics and Business Administration.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:21:y:2003:i:1:p:21-37

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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.