A constructive proof of Ky Fan's coincidence theorem

A.J.J. Talman, Z.F. Yang

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
463 Downloads (Pure)


We present a constructive proof for the well-known Ky Fan’s coincidence theorem through a simplicial algorithm. In a finite number of steps the algorithm generates a simplex containing an approximate coincidence point. In the limit, when the mesh size converges to zero, the sequence of approximations converges to a coincidence point.
Original languageEnglish
Pages (from-to)317-325
JournalMathematical Programming
Issue number2
Publication statusPublished - 2009


Dive into the research topics of 'A constructive proof of Ky Fan's coincidence theorem'. Together they form a unique fingerprint.

Cite this