We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice Z(n) of the n-dimensional Euclidean space R-n. It is assumed that the set is integrally convex, w...
详细信息
We study the existence problem of a zero point of a function defined on a finite set of elements of the integer lattice Z(n) of the n-dimensional Euclidean space R-n. It is assumed that the set is integrally convex, which implies that the convex hull of the set can be subdivided in simplices such that every vertex is an element of Z(n) and each simplex of the triangulation lies in an n-dimensional cube of size one. With respect to this triangulation we assume that the function satisfies some property that replaces continuity. Under this property and some boundary condition the function has a zero point. To prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The standard technique of applying a fixed point theorem to a piecewise linear approximation cannot be applied, because the 'continuity property' is too weak to assure that a zero point of the piecewise linear approximation induces a zero point of the function itself. We apply the main existence result to prove the existence of a pure Cournot-Nash equilibrium in a Cournot oligopoly model. We further obtain a discrete analogue of the well-known Borsuk-Ulam theorem and a theorem for the existence of a solution for the discrete nonlinear complementarity problem. (C) 2011 Published by Elsevier By.
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 p...
详细信息
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.
We prove the existence of a path of market conditions, i.e. combinations of market prices and production quantities, that links any arbitrarily chosen market condition with an equilibrium, in a general equilibrium mod...
详细信息
We prove the existence of a path of market conditions, i.e. combinations of market prices and production quantities, that links any arbitrarily chosen market condition with an equilibrium, in a general equilibrium model with possibly nonconvex production technologies based on Villar [Villar, A., 1994. Equilibrium with nonconvex production technologies. Economic Theory 4, 629-638] and Villar [Villar, A., 1999. Equilibrium and Efficiency in Production Economies, second ed., Springer Verlag, Berlin]. This existence theorem holds for any semi-algebraic version of the model and the adjustment of market conditions along the path can be given an economic interpretation as a tatonnement process. Any such path can be approximated arbitrarily close by applying a simplicial algorithm. By restarting this algorithm in a different market condition, we may find more than one equilibrium. (c) 2005 Elsevier B.V. All rights reserved.
In this paper a price and quantity adjustment process in continuous time is considered for an economy facing price rigidities. In the short run prices are assumed to be completely fixed and the markets are cleared by ...
详细信息
In this paper a price and quantity adjustment process in continuous time is considered for an economy facing price rigidities. In the short run prices are assumed to be completely fixed and the markets are cleared by quantity adjustments until a fixed price equilibrium is reached where every market is typically characterized by either supply rationing or demand rationing. Using only standard assumptions on the primitive concepts of the economy and a non-degeneracy condition, it is shown that the process indeed converges to a fixed price equilibrium for the initially given prices in the short run. In the long run prices are assumed to move upwards in the case of demand rationing on a market and downwards when supply rationing occurs, while markets are kept in equilibrium by infinitesimal quantity adjustments. Again, under standard assumptions on the primitive concepts of the economy and a non-degeneracy condition, the process is shown to reach a Walrasian equilibrium in the long run. A simplicial algorithm has been developed to make the study of the price and quantity adjustment process possible and the accuracy of this algorithm is discussed. (C) 1998 Elsevier Science S.A.
We consider an exchange economy in which price rigidities are present. An always converging price and quantity adjustment process for such an economy is presented that is based on a discrete algorithmic procedure rath...
详细信息
We consider an exchange economy in which price rigidities are present. An always converging price and quantity adjustment process for such an economy is presented that is based on a discrete algorithmic procedure rather than on more traditional adjustment processes, which are based on difference or differential equations. In the short run, all non-numeraire commodities have a flexible price level with respect to the numeraire commodity but their relative prices are mutually fixed. In the long run, prices are assumed to be completely flexible. The adjustment process starts with a trivial equilibrium with a low enough price level and complete demand rationing on all markets. Along the path followed by the adjustment process, initially all relative prices of the non-numeraire commodities are kept fixed and the price level is increased. Rationing schemes are adjusted to keep markets in equilibrium. In doing so, the process reaches a short-run equilibrium with only demand rationing and no rationing on the numeraire and at least one of the other commodities. In the long run, the process allows for a downward price adjustment of unrationed non-numeraire commodities and eventually reaches a Walrasian equilibrium.
A continuous deformation algorithm is proposed for solving a variational inequality problem on a polytope K. The algorithm embeds the polytope K into K x [0, infinity) and starts by applying a variable dimension algor...
详细信息
A continuous deformation algorithm is proposed for solving a variational inequality problem on a polytope K. The algorithm embeds the polytope K into K x [0, infinity) and starts by applying a variable dimension algorithm on K x {0} until an approximate solution is found on K x {0}. Then by tracing the path of solutions of a system of equations the algorithm virtually follows a path of approximate solution in K x [0, infinity). When the path in K x [0, infinity) returns to level 0, i.e., K x {0}, the variable dimension algorithm is again used until a new approximate solution is found on K x {0}. The set K x [0, infinity) is triangulated so that the approximate solution on the path improves the accuracy as the level increases. A contrivance for a practical implementation of the algorithm is proposed and tested for some test problems.
In this paper, we present a computationally tractable method for constructing the value set G(jR ; Q) of a family of parametric transfer functions G(s; q), where j =, Q is an m-dimensional box in R, and R = [0, ∞). T...
详细信息
In this paper, we present a computationally tractable method for constructing the value set G(jR ; Q) of a family of parametric transfer functions G(s; q), where j =, Q is an m-dimensional box in R, and R = [0, ∞). The method is based on characterizing the whole set of generalized principal points in the space R x Q whose image under the mapping G(jw ; q) covers the boundary of the value set G(jR ; Q). By searching the points over the set of generalized principal points, the H-norm for systems with parametric uncertainties can be accurately obtained. Thus, the proposed method makes it feasible to design robust H ∞ controllers for uncertain linear systems having a general structure of parameter perturbations, including uncertain time delays. To illustrate the effectiveness of the proposed method, an illustrative example is provided.
Let f:Z~n→R~n be a mapping satisfying the direction preserving property that f(x) > 0 implies f(y)≥0 for any integer points x and y with ||x-y||∞≤*** assume that there is an integer point x with c≤x≤d sat...
详细信息
Let f:Z~n→R~n be a mapping satisfying the direction preserving property that f(x) > 0 implies f(y)≥0 for any integer points x and y with ||x-y||∞≤*** assume that there is an integer point x with c≤x≤d satisfying that (?)(x-x)f(x) >0 for any integer point x with f(x)≠0 on the boundary of H = {x∈R~n|c-e≤x≤d + e},where c and d are two finite integer points with c≤d and e =(1,1,…,1)∈R~*** assumption is implied by one of two different conditions for the existence of an integer zero point of the mapping in van der Laan et al.(2004).Under the assumption,there is an integer point x*∈H such that f{x*) = 0.A constructive proof of the existence is derived from an application of the well-known (n +1)-ray algorithm for computing a fixed *** existence result has applications in general equilibrium models with indivisible commodities.
暂无评论