Showing 1 - 10 of 64
Random matching models with different states are an important class of dynamic games; for example, money search models, job search models, and some games in biology are special cases.In this paper, we investigate the basic structure of the models: the existence of equilibria, the global...
Persistent link: https://www.econbiz.de/10011090770
Random matching models with different states are an important class of dynamic games; for example, money search models, job search models, and some games in biology are special cases. In this paper, we investigate the basic structure of the models: the existence of equilibria, the global...
Persistent link: https://www.econbiz.de/10014071276
In this paper a price and quantity adjustment process in continuous time is considered for an economy with production factors and final goods. We assume that each final good is produced by a constant returns to scale production technology with only factor goods as inputs. The price and quantity...
Persistent link: https://www.econbiz.de/10014192613
Persistent link: https://www.econbiz.de/10003807125
In a standard general equilibrium model it is assumed that there are no price restictionsand that prices adjust infinitely fast to their equilibrium values. In this paper the set ofadmissible prices is allowed to be an arbitrary convex set. For such an arbitrary set it cannotbe guaranteed that...
Persistent link: https://www.econbiz.de/10011257502
Any function from a non-empty polytope into itself that is locally gross direction preserving is shown to have the fixed point property. Brouwer's fixed point theorem for continuous functions is a special case. We discuss the application of the result in the area of non-cooperative game...</p>
Persistent link: https://www.econbiz.de/10011257532
Persistent link: https://www.econbiz.de/10011090907
Persistent link: https://www.econbiz.de/10011091292
AMS classifications: 54H25, 65K10, 49J53, 68W25
Persistent link: https://www.econbiz.de/10011091823
In this paper, several problem reduction techniques are discussed that can be used to reduce the solution time of set partitioning problems. These techniques can be applied in any solution algorithm for set partitioning problems. Besides a short review of the existing literature on preprocessing...
Persistent link: https://www.econbiz.de/10011092120