A constructive proof of Ky Fan’s coincidence theorem

被引：0
|
作者：
A. J. J. Talman
Z. Yang
机构：
[1] Tilburg University,CentER, Department of Econometrics and Operations Research
[2] Yokohama National University,Faculty of Business Administration
来源：
Mathematical Programming | 2009年 / 118卷
关键词：
Fan’s coincidence theorem; Fixed point; Simplicial algorithm; Upper semi-continuity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：317 / 325
页数：8
相关论文
共 50 条
12345