A short and constructive proof of Tarski’s fixed-point theorem
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.)
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.
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.
Volume (Year): 33 (2005)
Issue (Month): 2 (06)
|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|
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.:
- 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.
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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.