A constructive proof of Ky Fan's coincidence theorem
type: Item
instance of: scholarly article
title: A constructive proof of Ky Fan's coincidence theorem
zbMATH Open document ID: 1171.54037
author: Zaifu Yang
author: Dolf Talman
published in: Mathematical Programming. Series A. Series B
publication date: 2009-05-04T00:00:00Z
review text: To show the existence of solutions in economic problems, game theoretical problem and other fields in mathematics and engineering, one usually refers to the fixed point theorems of Brouwer and Kakutani or to one of the related theorems. It is well known for researchers in these fields that these fixed point theorems can be constructively proofed through simplicial algorithms. But more recent developments in these research areas led to the result that the theorem of Brouwer and Kakutani (or related solution methods/algorithms) is no longer sufficient, and researchers used the coincidence theorem by Ky Fan to prove the existence of solutions in given problems. In the paper Talman and Yang show that Fan's coincidence theorem can be constructively proved via a simplicial algorithm as well. The advantage of this proof is given by the fact that the constructive proof is also of practical use in the sense that also numerical methods can be used to compute equilibria in the above mentioned economic problems (at least approximately). This then enables the researcher to evaluate and to analyze the policy implications of the models under investigation. The relevance of the proof is that the boundary condition differs considerably from those made in Brouwer's theorem and its extensions. And furthermore, the assumptions made in the theorem with respect to the separation conditions and boundary conditions are weaker than the corresponding assumptions in a fixed point theorem.
Mathematics Subject Classification ID: 54H25
Mathematics Subject Classification ID: 47H10
Mathematics Subject Classification ID: 91B02
zbMATH DE Number: 5550542
zbMATH Keywords: Fan's coincidence theorem
zbMATH Keywords: fixed point
zbMATH Keywords: simplicial algorithm
zbMATH Keywords: upper semi-continuity
MaRDI profile type: Publication
OpenAlex ID: W1987394809
cites work: Q3998344
cites work: Q4070950
cites work: A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
cites work: Q4057217
cites work: Q3674431
cites work: The Approximation of Fixed Points of a Continuous Mapping
cites work: The computation of fixed points and applications
cites work: An existence theorem for a bargaining set
cites work: The octahedral algorithm, a new simplicial fixed point algorithm
cites work: Q4935258
cites work: An intersection theorem on an unbounded set and its application to the fair allocation problem
DOI: 10.1007/S10107-007-0194-5
Recommended article: Q4763883
Recommended article: Q4322107
Recommended article: Q4549068
Recommended article: A constructive proof of Ky Fan's generalization of Tucker's lemma
Recommended article: Q3436832
Recommended article: A Van Kampen type theorem for coincidences
Recommended article: A Remark on Coincidence Theorems
Recommended article: Q4873951
Recommended article: Q3365513
Recommended article: A constructive proof of Kirszbraun's theorem
description: scientific article; zbMATH DE number 5550542