On the approximation of upper semi-continuous correspondences and the equilibria of generalized games (Q1262228)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the approximation of upper semi-continuous correspondences and the equilibria of generalized games |
scientific article; zbMATH DE number 4123554
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the approximation of upper semi-continuous correspondences and the equilibria of generalized games |
scientific article; zbMATH DE number 4123554 |
Statements
On the approximation of upper semi-continuous correspondences and the equilibria of generalized games (English)
0 references
1988
0 references
An approximating family for a correspondence is an indexed family of correspondences containing the original one and shrinking towards it. It is shown that correspondences with suitable regularity assumptions have approximating families, where each member is constructed from a fixed family of convex sets using partitions of unity. The result is used to give new proofs of the existence of equilibria in generalized games.
0 references
approximating family
0 references
correspondence
0 references
existence of equilibria
0 references
generalized games
0 references
0 references
0 references
0 references
0 references
0 references
0.9164371
0 references
0.90597975
0 references
0.90388536
0 references
0.9025376
0 references
0.90086854
0 references
0.8999631
0 references
0.89919657
0 references
