A constructive proof of Ky Fan's coincidence theorem

DOI10.1007/s10107-007-0194-5zbMath1171.54037OpenAlexW1987394809MaRDI QIDQ1016124

Zaifu Yang, Adolphus J. J. Talman

Publication date: 4 May 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/9f92e51a-4229-4bbe-9a75-5dc61c0ce1e4

zbMATH Keywords

fixed pointupper semi-continuitysimplicial algorithmFan's coincidence theorem

Mathematics Subject Classification ID

Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02) Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25)

Related Items (1)

On the nonemptiness of approximate cores of large games

Cites Work

• The computation of fixed points and applications
• An intersection theorem on an unbounded set and its application to the fair allocation problem
• An existence theorem for a bargaining set
• The octahedral algorithm, a new simplicial fixed point algorithm
• A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
• The Approximation of Fixed Points of a Continuous Mapping
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A constructive proof of Ky Fan's coincidence theorem