Two simple proofs of the feasibility of the linear tracing procedure
Theories of equilibrium selection in non-cooperative games, as well as the notion of risk dominance, depend heavily on the so-called linear tracing procedure. This is the first paper to give direct, simple proofs of the feasibility of the linear tracing procedure. The first proof utilizes a result that is related to Kakutani's fixed point theorem and that is an extension of Browder's fixed point theorem. The second proof shows that it is even possible to avoid the use of correspondences.
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): 15 (2000)
Issue (Month): 2 ()
|Note:||Received: June 8, 1998; revised version: November 8, 1998|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:15:y:2000:i:2:p:485-490. 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.