Advanced Search
MyIDEAS: Login to save this article or follow this journal

A short and constructive proof of Tarski’s fixed-point theorem

Contents:

Author Info

  • Federico Echenique

    ()

Abstract

I give short and constructive proofs of Tarski's fixed-point theorem, and of a much-used extension of Tarski's fixed-point theorem to set- valued maps.

(This abstract was borrowed from another version of this item.)

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/s001820400192
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 International Journal of Game Theory.

Volume (Year): 33 (2005)
Issue (Month): 2 (06)
Pages: 215-218

as in new window
Handle: RePEc:spr:jogath:v:33:y:2005:i:2:p:215-218

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

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

Related research

Keywords: Tarski’s fixed-point theorem; games of strategic complimentarities; supermodular games;

Other versions of this item:

Find related papers by JEL classification:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Zhou Lin, 1994. "The Set of Nash Equilibria of a Supermodular Game Is a Complete Lattice," Games and Economic Behavior, Elsevier, vol. 7(2), pages 295-300, September.
Full references (including those not matched with items on IDEAS)

Citations

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

Cited by:
  1. Karagözoğlu, Emin & Keskin, Kerim & Sağlam, Çağrı, 2013. "A minimally altruistic refinement of Nash equilibrium," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 422-430.
  2. Kucuksenel, Serkan, 2011. "Core of the assignment game via fixed point methods," Journal of Mathematical Economics, Elsevier, vol. 47(1), pages 72-76, January.
  3. Federico Quartieri, 2013. "Coalition-proofness under weak and strong Pareto dominance," Social Choice and Welfare, Springer, vol. 40(2), pages 553-579, February.

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:jogath:v:33:y:2005:i:2:p:215-218. 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 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.